./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ec264141-9883-44d4-a949-262a341fdc80/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_ec264141-9883-44d4-a949-262a341fdc80/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ec264141-9883-44d4-a949-262a341fdc80/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ec264141-9883-44d4-a949-262a341fdc80/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ec264141-9883-44d4-a949-262a341fdc80/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ec264141-9883-44d4-a949-262a341fdc80/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 6ad465e26a1a888ad1835cc610c373ccd5bfcbe1 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 06:39:01,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 06:39:01,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 06:39:01,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 06:39:01,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 06:39:01,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 06:39:01,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 06:39:01,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 06:39:01,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 06:39:01,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 06:39:01,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 06:39:01,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 06:39:01,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 06:39:01,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 06:39:01,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 06:39:01,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 06:39:01,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 06:39:01,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 06:39:01,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 06:39:01,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 06:39:01,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 06:39:01,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 06:39:01,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 06:39:01,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 06:39:01,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 06:39:01,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 06:39:01,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 06:39:01,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 06:39:01,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 06:39:01,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 06:39:01,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 06:39:01,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 06:39:01,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 06:39:01,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 06:39:01,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 06:39:01,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 06:39:01,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 06:39:01,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 06:39:01,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 06:39:01,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 06:39:01,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 06:39:01,330 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ec264141-9883-44d4-a949-262a341fdc80/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 06:39:01,352 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 06:39:01,352 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 06:39:01,353 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 06:39:01,353 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 06:39:01,353 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 06:39:01,354 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 06:39:01,354 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 06:39:01,354 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 06:39:01,354 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 06:39:01,354 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 06:39:01,354 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 06:39:01,355 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 06:39:01,355 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 06:39:01,355 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 06:39:01,355 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 06:39:01,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 06:39:01,356 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 06:39:01,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 06:39:01,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 06:39:01,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 06:39:01,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 06:39:01,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 06:39:01,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 06:39:01,357 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 06:39:01,357 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 06:39:01,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 06:39:01,358 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 06:39:01,358 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 06:39:01,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 06:39:01,358 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 06:39:01,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 06:39:01,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 06:39:01,359 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 06:39:01,359 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 06:39:01,359 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 06:39:01,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 06:39:01,359 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 06:39:01,360 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 06:39:01,360 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 06:39:01,360 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_ec264141-9883-44d4-a949-262a341fdc80/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_ec264141-9883-44d4-a949-262a341fdc80/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 -> 6ad465e26a1a888ad1835cc610c373ccd5bfcbe1 [2020-12-09 06:39:01,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 06:39:01,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 06:39:01,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 06:39:01,568 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 06:39:01,568 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 06:39:01,569 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ec264141-9883-44d4-a949-262a341fdc80/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix042_tso.opt.i [2020-12-09 06:39:01,610 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ec264141-9883-44d4-a949-262a341fdc80/bin/utaipan/data/f8863530a/db2a202e16dc4109aed2bd582c0890a0/FLAGd91baeb3e [2020-12-09 06:39:02,033 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 06:39:02,033 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ec264141-9883-44d4-a949-262a341fdc80/sv-benchmarks/c/pthread-wmm/mix042_tso.opt.i [2020-12-09 06:39:02,045 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ec264141-9883-44d4-a949-262a341fdc80/bin/utaipan/data/f8863530a/db2a202e16dc4109aed2bd582c0890a0/FLAGd91baeb3e [2020-12-09 06:39:02,060 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ec264141-9883-44d4-a949-262a341fdc80/bin/utaipan/data/f8863530a/db2a202e16dc4109aed2bd582c0890a0 [2020-12-09 06:39:02,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 06:39:02,063 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 06:39:02,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 06:39:02,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 06:39:02,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 06:39:02,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:39:02" (1/1) ... [2020-12-09 06:39:02,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fbe9e1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:02, skipping insertion in model container [2020-12-09 06:39:02,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:39:02" (1/1) ... [2020-12-09 06:39:02,072 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 06:39:02,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 06:39:02,203 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_ec264141-9883-44d4-a949-262a341fdc80/sv-benchmarks/c/pthread-wmm/mix042_tso.opt.i[948,961] [2020-12-09 06:39:02,316 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:39:02,322 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 06:39:02,331 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_ec264141-9883-44d4-a949-262a341fdc80/sv-benchmarks/c/pthread-wmm/mix042_tso.opt.i[948,961] [2020-12-09 06:39:02,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:39:02,425 INFO L208 MainTranslator]: Completed translation [2020-12-09 06:39:02,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:02 WrapperNode [2020-12-09 06:39:02,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 06:39:02,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 06:39:02,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 06:39:02,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 06:39:02,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:02" (1/1) ... [2020-12-09 06:39:02,444 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:02" (1/1) ... [2020-12-09 06:39:02,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 06:39:02,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 06:39:02,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 06:39:02,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 06:39:02,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:02" (1/1) ... [2020-12-09 06:39:02,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:02" (1/1) ... [2020-12-09 06:39:02,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:02" (1/1) ... [2020-12-09 06:39:02,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:02" (1/1) ... [2020-12-09 06:39:02,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:02" (1/1) ... [2020-12-09 06:39:02,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:02" (1/1) ... [2020-12-09 06:39:02,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:02" (1/1) ... [2020-12-09 06:39:02,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 06:39:02,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 06:39:02,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 06:39:02,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 06:39:02,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ec264141-9883-44d4-a949-262a341fdc80/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 06:39:02,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 06:39:02,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 06:39:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 06:39:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 06:39:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-09 06:39:02,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-09 06:39:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-09 06:39:02,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-09 06:39:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-09 06:39:02,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-09 06:39:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 06:39:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 06:39:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 06:39:02,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 06:39:02,573 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-09 06:39:03,787 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 06:39:03,787 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-09 06:39:03,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:39:03 BoogieIcfgContainer [2020-12-09 06:39:03,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 06:39:03,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 06:39:03,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 06:39:03,792 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 06:39:03,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:39:02" (1/3) ... [2020-12-09 06:39:03,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c765a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:39:03, skipping insertion in model container [2020-12-09 06:39:03,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:02" (2/3) ... [2020-12-09 06:39:03,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c765a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:39:03, skipping insertion in model container [2020-12-09 06:39:03,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:39:03" (3/3) ... [2020-12-09 06:39:03,794 INFO L111 eAbstractionObserver]: Analyzing ICFG mix042_tso.opt.i [2020-12-09 06:39:03,805 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 06:39:03,805 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 06:39:03,807 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 06:39:03,808 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 06:39:03,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,838 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,838 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,839 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,839 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,840 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,840 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,841 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,841 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,844 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,844 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,844 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,845 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,845 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,845 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,845 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,845 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,850 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,851 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,851 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,853 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,853 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,855 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,855 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:39:03,857 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-09 06:39:03,864 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-09 06:39:03,878 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 06:39:03,879 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 06:39:03,879 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 06:39:03,879 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 06:39:03,879 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 06:39:03,879 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 06:39:03,879 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 06:39:03,879 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 06:39:03,888 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 06:39:03,889 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 101 transitions, 217 flow [2020-12-09 06:39:03,891 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 101 transitions, 217 flow [2020-12-09 06:39:03,892 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 217 flow [2020-12-09 06:39:03,928 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2020-12-09 06:39:03,929 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-09 06:39:03,931 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-12-09 06:39:03,934 INFO L116 LiptonReduction]: Number of co-enabled transitions 1738 [2020-12-09 06:39:04,113 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:04,113 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:04,115 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:04,115 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:04,179 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:04,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:04,181 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:04,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:04,931 WARN L197 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-12-09 06:39:05,223 WARN L197 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-12-09 06:39:06,732 WARN L197 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2020-12-09 06:39:07,328 WARN L197 SmtUtils]: Spent 595.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2020-12-09 06:39:07,440 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:07,440 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:07,441 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:07,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:07,443 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:07,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:07,446 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:07,447 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:07,467 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:07,467 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:07,468 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:07,468 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:07,470 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:07,471 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:07,473 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:07,473 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:07,881 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-09 06:39:08,292 WARN L197 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-09 06:39:08,402 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-12-09 06:39:08,509 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:08,510 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:08,510 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:08,510 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:08,533 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:08,534 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:08,535 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:08,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:08,587 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:08,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:08,588 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:08,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:08,590 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:08,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:08,592 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:08,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:08,607 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:08,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:08,608 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:08,609 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:08,610 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:08,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:08,612 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:08,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:08,753 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:08,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:08,754 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:08,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:08,755 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:08,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:08,757 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:08,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:08,771 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:08,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:08,772 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:08,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:08,774 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:08,774 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:08,775 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:08,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:09,089 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,090 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:09,090 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,091 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:09,092 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,093 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:09,094 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,094 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:09,112 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:09,113 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,113 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:09,115 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,115 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:09,117 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,118 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:09,160 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:09,161 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:09,163 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:09,165 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,166 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:09,182 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:09,183 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:09,185 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,185 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:09,187 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,187 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:09,265 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:09,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:09,266 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:09,267 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:09,287 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:09,287 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:09,288 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:09,288 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:09,320 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:09,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:09,321 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:09,321 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:09,354 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:09,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:09,355 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:09,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:09,467 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,467 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:09,468 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,468 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:09,469 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:09,471 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,471 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:09,482 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:09,483 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,484 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:09,485 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,485 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:09,486 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:09,773 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-09 06:39:09,896 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-09 06:39:09,912 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:09,913 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:09,914 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:09,915 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:09,926 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,926 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:09,927 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,927 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:09,928 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,928 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:09,929 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:09,929 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:10,179 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:10,180 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:10,181 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:10,183 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:10,194 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,194 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:10,195 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:10,196 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,196 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:10,197 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:10,291 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:10,292 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:10,293 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,293 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:10,294 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:10,308 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,308 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:10,308 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,308 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:10,309 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,310 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:10,311 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:10,384 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,385 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:10,385 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,385 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:10,386 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,386 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:10,387 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:10,399 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:10,400 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,400 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:10,401 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,401 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:10,403 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,403 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:10,463 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,463 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:10,464 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,464 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:10,465 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:10,467 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,467 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:39:10,478 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,479 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:10,479 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,479 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:39:10,480 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,480 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:10,481 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:39:10,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:10,950 WARN L197 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2020-12-09 06:39:11,277 WARN L197 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2020-12-09 06:39:11,900 WARN L197 SmtUtils]: Spent 620.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2020-12-09 06:39:12,538 WARN L197 SmtUtils]: Spent 637.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2020-12-09 06:39:13,205 WARN L197 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 191 [2020-12-09 06:39:13,546 WARN L197 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2020-12-09 06:39:14,193 WARN L197 SmtUtils]: Spent 645.00 ms on a formula simplification that was a NOOP. DAG size: 271 [2020-12-09 06:39:14,886 WARN L197 SmtUtils]: Spent 692.00 ms on a formula simplification that was a NOOP. DAG size: 271 [2020-12-09 06:39:15,249 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:15,250 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:15,250 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:15,250 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:15,269 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:15,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:15,269 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:15,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:15,737 WARN L197 SmtUtils]: Spent 457.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2020-12-09 06:39:16,238 WARN L197 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2020-12-09 06:39:16,885 WARN L197 SmtUtils]: Spent 644.00 ms on a formula simplification that was a NOOP. DAG size: 280 [2020-12-09 06:39:17,514 WARN L197 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 280 [2020-12-09 06:39:17,527 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:17,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:17,527 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:17,528 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:17,543 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:17,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:17,544 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:17,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:17,566 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:17,566 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:17,567 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:17,567 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:17,585 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:17,585 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:17,585 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:17,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:17,606 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:17,606 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:17,607 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:17,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:17,626 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:17,626 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:17,626 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:17,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:17,645 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:17,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:17,645 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:17,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:17,663 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:17,663 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:17,664 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:17,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:18,101 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:18,102 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:18,102 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:18,102 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:18,117 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:18,117 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:18,118 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:18,118 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:18,154 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:18,155 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:18,155 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:18,155 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:18,172 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:18,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:18,173 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:18,173 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:18,692 WARN L197 SmtUtils]: Spent 508.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2020-12-09 06:39:19,240 WARN L197 SmtUtils]: Spent 547.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2020-12-09 06:39:20,363 WARN L197 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 282 [2020-12-09 06:39:21,537 WARN L197 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 282 [2020-12-09 06:39:21,895 WARN L197 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-12-09 06:39:22,058 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-12-09 06:39:22,407 WARN L197 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-12-09 06:39:22,576 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-12-09 06:39:22,600 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:22,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:22,600 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:22,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:22,619 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:22,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:22,619 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:22,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:22,642 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:22,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:22,642 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:22,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:22,664 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:22,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:22,665 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:22,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:22,706 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:22,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:22,706 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:22,707 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:22,722 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:22,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:22,723 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:22,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:22,753 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:22,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:22,754 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:22,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:22,777 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:39:22,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:22,778 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:39:22,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:39:22,801 INFO L131 LiptonReduction]: Checked pairs total: 4356 [2020-12-09 06:39:22,801 INFO L133 LiptonReduction]: Total number of compositions: 87 [2020-12-09 06:39:22,806 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-12-09 06:39:22,841 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 750 states. [2020-12-09 06:39:22,842 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states. [2020-12-09 06:39:22,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 06:39:22,846 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:39:22,846 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:39:22,846 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:39:22,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:39:22,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1771006948, now seen corresponding path program 1 times [2020-12-09 06:39:22,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:39:22,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143242548] [2020-12-09 06:39:22,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:39:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:39:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:39:23,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143242548] [2020-12-09 06:39:23,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:39:23,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 06:39:23,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55698458] [2020-12-09 06:39:23,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 06:39:23,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:39:23,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 06:39:23,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 06:39:23,033 INFO L87 Difference]: Start difference. First operand 750 states. Second operand 3 states. [2020-12-09 06:39:23,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:39:23,117 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-12-09 06:39:23,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 06:39:23,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-09 06:39:23,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:39:23,140 INFO L225 Difference]: With dead ends: 650 [2020-12-09 06:39:23,140 INFO L226 Difference]: Without dead ends: 530 [2020-12-09 06:39:23,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 06:39:23,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-12-09 06:39:23,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-12-09 06:39:23,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-12-09 06:39:23,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1622 transitions. [2020-12-09 06:39:23,198 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1622 transitions. Word has length 7 [2020-12-09 06:39:23,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:39:23,199 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1622 transitions. [2020-12-09 06:39:23,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 06:39:23,199 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1622 transitions. [2020-12-09 06:39:23,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 06:39:23,200 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:39:23,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:39:23,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 06:39:23,200 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:39:23,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:39:23,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1130556463, now seen corresponding path program 1 times [2020-12-09 06:39:23,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:39:23,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652777510] [2020-12-09 06:39:23,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:39:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:39:23,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:39:23,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652777510] [2020-12-09 06:39:23,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:39:23,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 06:39:23,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317249134] [2020-12-09 06:39:23,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:39:23,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:39:23,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:39:23,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:39:23,359 INFO L87 Difference]: Start difference. First operand 530 states and 1622 transitions. Second operand 4 states. [2020-12-09 06:39:23,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:39:23,388 INFO L93 Difference]: Finished difference Result 522 states and 1592 transitions. [2020-12-09 06:39:23,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 06:39:23,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-09 06:39:23,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:39:23,393 INFO L225 Difference]: With dead ends: 522 [2020-12-09 06:39:23,394 INFO L226 Difference]: Without dead ends: 522 [2020-12-09 06:39:23,394 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:39:23,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-12-09 06:39:23,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2020-12-09 06:39:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2020-12-09 06:39:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1592 transitions. [2020-12-09 06:39:23,413 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1592 transitions. Word has length 9 [2020-12-09 06:39:23,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:39:23,414 INFO L481 AbstractCegarLoop]: Abstraction has 522 states and 1592 transitions. [2020-12-09 06:39:23,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:39:23,414 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1592 transitions. [2020-12-09 06:39:23,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 06:39:23,415 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:39:23,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:39:23,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 06:39:23,415 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:39:23,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:39:23,416 INFO L82 PathProgramCache]: Analyzing trace with hash -687512680, now seen corresponding path program 1 times [2020-12-09 06:39:23,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:39:23,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941395472] [2020-12-09 06:39:23,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:39:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:39:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:39:23,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941395472] [2020-12-09 06:39:23,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:39:23,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 06:39:23,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859285842] [2020-12-09 06:39:23,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 06:39:23,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:39:23,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 06:39:23,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 06:39:23,487 INFO L87 Difference]: Start difference. First operand 522 states and 1592 transitions. Second operand 3 states. [2020-12-09 06:39:23,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:39:23,500 INFO L93 Difference]: Finished difference Result 490 states and 1480 transitions. [2020-12-09 06:39:23,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 06:39:23,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-12-09 06:39:23,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:39:23,506 INFO L225 Difference]: With dead ends: 490 [2020-12-09 06:39:23,506 INFO L226 Difference]: Without dead ends: 490 [2020-12-09 06:39:23,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 06:39:23,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2020-12-09 06:39:23,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2020-12-09 06:39:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2020-12-09 06:39:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1480 transitions. [2020-12-09 06:39:23,525 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1480 transitions. Word has length 10 [2020-12-09 06:39:23,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:39:23,525 INFO L481 AbstractCegarLoop]: Abstraction has 490 states and 1480 transitions. [2020-12-09 06:39:23,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 06:39:23,526 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1480 transitions. [2020-12-09 06:39:23,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 06:39:23,528 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:39:23,528 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:39:23,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 06:39:23,528 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:39:23,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:39:23,529 INFO L82 PathProgramCache]: Analyzing trace with hash 161943201, now seen corresponding path program 1 times [2020-12-09 06:39:23,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:39:23,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497576794] [2020-12-09 06:39:23,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:39:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:39:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:39:23,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497576794] [2020-12-09 06:39:23,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:39:23,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 06:39:23,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321640363] [2020-12-09 06:39:23,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:39:23,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:39:23,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:39:23,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:39:23,677 INFO L87 Difference]: Start difference. First operand 490 states and 1480 transitions. Second operand 5 states. [2020-12-09 06:39:23,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:39:23,759 INFO L93 Difference]: Finished difference Result 474 states and 1420 transitions. [2020-12-09 06:39:23,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 06:39:23,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-12-09 06:39:23,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:39:23,765 INFO L225 Difference]: With dead ends: 474 [2020-12-09 06:39:23,765 INFO L226 Difference]: Without dead ends: 474 [2020-12-09 06:39:23,765 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:39:23,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2020-12-09 06:39:23,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2020-12-09 06:39:23,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2020-12-09 06:39:23,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1420 transitions. [2020-12-09 06:39:23,787 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1420 transitions. Word has length 11 [2020-12-09 06:39:23,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:39:23,787 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 1420 transitions. [2020-12-09 06:39:23,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:39:23,788 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1420 transitions. [2020-12-09 06:39:23,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 06:39:23,789 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:39:23,790 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:39:23,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 06:39:23,790 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:39:23,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:39:23,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1797623666, now seen corresponding path program 1 times [2020-12-09 06:39:23,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:39:23,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790165862] [2020-12-09 06:39:23,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:39:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:39:23,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:39:23,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790165862] [2020-12-09 06:39:23,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:39:23,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:39:23,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436949156] [2020-12-09 06:39:23,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:39:23,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:39:23,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:39:23,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:39:23,943 INFO L87 Difference]: Start difference. First operand 474 states and 1420 transitions. Second operand 6 states. [2020-12-09 06:39:24,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:39:24,024 INFO L93 Difference]: Finished difference Result 510 states and 1543 transitions. [2020-12-09 06:39:24,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:39:24,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-09 06:39:24,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:39:24,029 INFO L225 Difference]: With dead ends: 510 [2020-12-09 06:39:24,029 INFO L226 Difference]: Without dead ends: 510 [2020-12-09 06:39:24,029 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:39:24,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2020-12-09 06:39:24,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2020-12-09 06:39:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2020-12-09 06:39:24,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1543 transitions. [2020-12-09 06:39:24,042 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1543 transitions. Word has length 13 [2020-12-09 06:39:24,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:39:24,042 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 1543 transitions. [2020-12-09 06:39:24,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:39:24,042 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1543 transitions. [2020-12-09 06:39:24,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 06:39:24,043 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:39:24,043 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:39:24,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 06:39:24,043 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:39:24,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:39:24,044 INFO L82 PathProgramCache]: Analyzing trace with hash -121520990, now seen corresponding path program 2 times [2020-12-09 06:39:24,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:39:24,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037822136] [2020-12-09 06:39:24,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:39:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:39:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:39:24,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037822136] [2020-12-09 06:39:24,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:39:24,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:39:24,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405733288] [2020-12-09 06:39:24,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:39:24,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:39:24,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:39:24,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:39:24,169 INFO L87 Difference]: Start difference. First operand 510 states and 1543 transitions. Second operand 6 states. [2020-12-09 06:39:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:39:24,278 INFO L93 Difference]: Finished difference Result 570 states and 1708 transitions. [2020-12-09 06:39:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:39:24,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-09 06:39:24,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:39:24,284 INFO L225 Difference]: With dead ends: 570 [2020-12-09 06:39:24,284 INFO L226 Difference]: Without dead ends: 570 [2020-12-09 06:39:24,284 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-12-09 06:39:24,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-12-09 06:39:24,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 518. [2020-12-09 06:39:24,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2020-12-09 06:39:24,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1561 transitions. [2020-12-09 06:39:24,309 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1561 transitions. Word has length 13 [2020-12-09 06:39:24,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:39:24,309 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 1561 transitions. [2020-12-09 06:39:24,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:39:24,309 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1561 transitions. [2020-12-09 06:39:24,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 06:39:24,310 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:39:24,310 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:39:24,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 06:39:24,311 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:39:24,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:39:24,311 INFO L82 PathProgramCache]: Analyzing trace with hash -162373100, now seen corresponding path program 3 times [2020-12-09 06:39:24,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:39:24,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305183723] [2020-12-09 06:39:24,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:39:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:39:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:39:24,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305183723] [2020-12-09 06:39:24,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:39:24,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:39:24,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171893856] [2020-12-09 06:39:24,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:39:24,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:39:24,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:39:24,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:39:24,426 INFO L87 Difference]: Start difference. First operand 518 states and 1561 transitions. Second operand 6 states. [2020-12-09 06:39:24,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:39:24,526 INFO L93 Difference]: Finished difference Result 614 states and 1829 transitions. [2020-12-09 06:39:24,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:39:24,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-09 06:39:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:39:24,532 INFO L225 Difference]: With dead ends: 614 [2020-12-09 06:39:24,532 INFO L226 Difference]: Without dead ends: 614 [2020-12-09 06:39:24,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 06:39:24,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-12-09 06:39:24,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 562. [2020-12-09 06:39:24,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-12-09 06:39:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1670 transitions. [2020-12-09 06:39:24,553 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1670 transitions. Word has length 13 [2020-12-09 06:39:24,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:39:24,553 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1670 transitions. [2020-12-09 06:39:24,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:39:24,553 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1670 transitions. [2020-12-09 06:39:24,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 06:39:24,554 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:39:24,555 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:39:24,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 06:39:24,555 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:39:24,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:39:24,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1008540544, now seen corresponding path program 1 times [2020-12-09 06:39:24,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:39:24,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576837768] [2020-12-09 06:39:24,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:39:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:39:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:39:24,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576837768] [2020-12-09 06:39:24,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:39:24,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 06:39:24,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823280658] [2020-12-09 06:39:24,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:39:24,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:39:24,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:39:24,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:39:24,603 INFO L87 Difference]: Start difference. First operand 562 states and 1670 transitions. Second operand 4 states. [2020-12-09 06:39:24,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:39:24,637 INFO L93 Difference]: Finished difference Result 552 states and 1452 transitions. [2020-12-09 06:39:24,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:39:24,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-09 06:39:24,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:39:24,641 INFO L225 Difference]: With dead ends: 552 [2020-12-09 06:39:24,641 INFO L226 Difference]: Without dead ends: 400 [2020-12-09 06:39:24,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:39:24,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2020-12-09 06:39:24,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2020-12-09 06:39:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-12-09 06:39:24,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1022 transitions. [2020-12-09 06:39:24,654 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1022 transitions. Word has length 13 [2020-12-09 06:39:24,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:39:24,654 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 1022 transitions. [2020-12-09 06:39:24,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:39:24,655 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1022 transitions. [2020-12-09 06:39:24,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 06:39:24,655 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:39:24,656 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:39:24,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 06:39:24,656 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:39:24,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:39:24,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1895829278, now seen corresponding path program 1 times [2020-12-09 06:39:24,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:39:24,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074954186] [2020-12-09 06:39:24,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:39:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:39:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:39:24,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074954186] [2020-12-09 06:39:24,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:39:24,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:39:24,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10046367] [2020-12-09 06:39:24,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:39:24,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:39:24,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:39:24,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:39:24,724 INFO L87 Difference]: Start difference. First operand 400 states and 1022 transitions. Second operand 5 states. [2020-12-09 06:39:24,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:39:24,774 INFO L93 Difference]: Finished difference Result 327 states and 768 transitions. [2020-12-09 06:39:24,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:39:24,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-12-09 06:39:24,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:39:24,776 INFO L225 Difference]: With dead ends: 327 [2020-12-09 06:39:24,776 INFO L226 Difference]: Without dead ends: 247 [2020-12-09 06:39:24,777 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:39:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2020-12-09 06:39:24,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2020-12-09 06:39:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-12-09 06:39:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 563 transitions. [2020-12-09 06:39:24,785 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 563 transitions. Word has length 14 [2020-12-09 06:39:24,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:39:24,785 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 563 transitions. [2020-12-09 06:39:24,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:39:24,785 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 563 transitions. [2020-12-09 06:39:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 06:39:24,786 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:39:24,786 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:39:24,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 06:39:24,786 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:39:24,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:39:24,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1582059309, now seen corresponding path program 1 times [2020-12-09 06:39:24,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:39:24,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157442709] [2020-12-09 06:39:24,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:39:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:39:24,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:39:24,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157442709] [2020-12-09 06:39:24,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:39:24,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 06:39:24,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917711862] [2020-12-09 06:39:24,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 06:39:24,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:39:24,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 06:39:24,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:39:24,899 INFO L87 Difference]: Start difference. First operand 247 states and 563 transitions. Second operand 7 states. [2020-12-09 06:39:25,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:39:25,028 INFO L93 Difference]: Finished difference Result 434 states and 958 transitions. [2020-12-09 06:39:25,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 06:39:25,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-12-09 06:39:25,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:39:25,030 INFO L225 Difference]: With dead ends: 434 [2020-12-09 06:39:25,031 INFO L226 Difference]: Without dead ends: 232 [2020-12-09 06:39:25,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-12-09 06:39:25,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-12-09 06:39:25,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 211. [2020-12-09 06:39:25,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-12-09 06:39:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 450 transitions. [2020-12-09 06:39:25,035 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 450 transitions. Word has length 17 [2020-12-09 06:39:25,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:39:25,035 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 450 transitions. [2020-12-09 06:39:25,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 06:39:25,035 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 450 transitions. [2020-12-09 06:39:25,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 06:39:25,036 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:39:25,036 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:39:25,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 06:39:25,036 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:39:25,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:39:25,037 INFO L82 PathProgramCache]: Analyzing trace with hash -775899141, now seen corresponding path program 2 times [2020-12-09 06:39:25,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:39:25,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049179973] [2020-12-09 06:39:25,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:39:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:39:25,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:39:25,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049179973] [2020-12-09 06:39:25,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:39:25,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 06:39:25,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110784100] [2020-12-09 06:39:25,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:39:25,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:39:25,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:39:25,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:39:25,092 INFO L87 Difference]: Start difference. First operand 211 states and 450 transitions. Second operand 6 states. [2020-12-09 06:39:25,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:39:25,139 INFO L93 Difference]: Finished difference Result 189 states and 405 transitions. [2020-12-09 06:39:25,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 06:39:25,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-09 06:39:25,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:39:25,141 INFO L225 Difference]: With dead ends: 189 [2020-12-09 06:39:25,141 INFO L226 Difference]: Without dead ends: 112 [2020-12-09 06:39:25,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:39:25,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-12-09 06:39:25,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2020-12-09 06:39:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-12-09 06:39:25,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 185 transitions. [2020-12-09 06:39:25,144 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 185 transitions. Word has length 17 [2020-12-09 06:39:25,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:39:25,145 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 185 transitions. [2020-12-09 06:39:25,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:39:25,145 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 185 transitions. [2020-12-09 06:39:25,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 06:39:25,145 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:39:25,145 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:39:25,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 06:39:25,146 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:39:25,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:39:25,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1160616381, now seen corresponding path program 1 times [2020-12-09 06:39:25,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:39:25,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76960000] [2020-12-09 06:39:25,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:39:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:39:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:39:25,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76960000] [2020-12-09 06:39:25,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:39:25,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 06:39:25,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585592611] [2020-12-09 06:39:25,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:39:25,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:39:25,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:39:25,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:39:25,204 INFO L87 Difference]: Start difference. First operand 92 states and 185 transitions. Second operand 4 states. [2020-12-09 06:39:25,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:39:25,222 INFO L93 Difference]: Finished difference Result 118 states and 233 transitions. [2020-12-09 06:39:25,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 06:39:25,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-12-09 06:39:25,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:39:25,224 INFO L225 Difference]: With dead ends: 118 [2020-12-09 06:39:25,224 INFO L226 Difference]: Without dead ends: 48 [2020-12-09 06:39:25,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:39:25,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-12-09 06:39:25,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-12-09 06:39:25,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-12-09 06:39:25,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2020-12-09 06:39:25,232 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 21 [2020-12-09 06:39:25,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:39:25,233 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2020-12-09 06:39:25,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:39:25,233 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2020-12-09 06:39:25,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 06:39:25,233 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:39:25,233 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:39:25,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 06:39:25,233 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:39:25,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:39:25,234 INFO L82 PathProgramCache]: Analyzing trace with hash 725619547, now seen corresponding path program 2 times [2020-12-09 06:39:25,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:39:25,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584482929] [2020-12-09 06:39:25,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:39:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:39:25,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:39:25,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584482929] [2020-12-09 06:39:25,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:39:25,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 06:39:25,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075135130] [2020-12-09 06:39:25,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 06:39:25,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:39:25,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 06:39:25,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-09 06:39:25,402 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand 8 states. [2020-12-09 06:39:25,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:39:25,521 INFO L93 Difference]: Finished difference Result 62 states and 103 transitions. [2020-12-09 06:39:25,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 06:39:25,522 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-12-09 06:39:25,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:39:25,523 INFO L225 Difference]: With dead ends: 62 [2020-12-09 06:39:25,523 INFO L226 Difference]: Without dead ends: 36 [2020-12-09 06:39:25,523 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-09 06:39:25,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-09 06:39:25,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-12-09 06:39:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-12-09 06:39:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2020-12-09 06:39:25,524 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 21 [2020-12-09 06:39:25,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:39:25,524 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2020-12-09 06:39:25,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 06:39:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2020-12-09 06:39:25,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 06:39:25,525 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:39:25,525 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:39:25,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 06:39:25,525 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:39:25,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:39:25,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2003264939, now seen corresponding path program 3 times [2020-12-09 06:39:25,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:39:25,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776042546] [2020-12-09 06:39:25,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:39:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 06:39:25,550 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 06:39:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 06:39:25,576 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 06:39:25,601 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 06:39:25,601 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 06:39:25,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 06:39:25,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:39:25 BasicIcfg [2020-12-09 06:39:25,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 06:39:25,656 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 06:39:25,657 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 06:39:25,657 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 06:39:25,657 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:39:03" (3/4) ... [2020-12-09 06:39:25,658 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 06:39:25,728 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ec264141-9883-44d4-a949-262a341fdc80/bin/utaipan/witness.graphml [2020-12-09 06:39:25,728 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 06:39:25,729 INFO L168 Benchmark]: Toolchain (without parser) took 23665.73 ms. Allocated memory was 90.2 MB in the beginning and 161.5 MB in the end (delta: 71.3 MB). Free memory was 70.0 MB in the beginning and 114.4 MB in the end (delta: -44.4 MB). Peak memory consumption was 105.9 MB. Max. memory is 16.1 GB. [2020-12-09 06:39:25,729 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 90.2 MB. Free memory was 66.0 MB in the beginning and 65.8 MB in the end (delta: 115.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 06:39:25,729 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.15 ms. Allocated memory is still 90.2 MB. Free memory was 69.7 MB in the beginning and 60.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 30.2 MB. Max. memory is 16.1 GB. [2020-12-09 06:39:25,730 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.43 ms. Allocated memory is still 90.2 MB. Free memory was 60.2 MB in the beginning and 57.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 06:39:25,730 INFO L168 Benchmark]: Boogie Preprocessor took 27.43 ms. Allocated memory is still 90.2 MB. Free memory was 57.5 MB in the beginning and 55.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 06:39:25,730 INFO L168 Benchmark]: RCFGBuilder took 1292.78 ms. Allocated memory was 90.2 MB in the beginning and 111.1 MB in the end (delta: 21.0 MB). Free memory was 55.0 MB in the beginning and 42.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 37.5 MB. Max. memory is 16.1 GB. [2020-12-09 06:39:25,731 INFO L168 Benchmark]: TraceAbstraction took 21866.23 ms. Allocated memory was 111.1 MB in the beginning and 161.5 MB in the end (delta: 50.3 MB). Free memory was 42.9 MB in the beginning and 37.1 MB in the end (delta: 5.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 16.1 GB. [2020-12-09 06:39:25,731 INFO L168 Benchmark]: Witness Printer took 71.52 ms. Allocated memory is still 161.5 MB. Free memory was 37.1 MB in the beginning and 114.4 MB in the end (delta: -77.2 MB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. [2020-12-09 06:39:25,733 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 90.2 MB. Free memory was 66.0 MB in the beginning and 65.8 MB in the end (delta: 115.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 362.15 ms. Allocated memory is still 90.2 MB. Free memory was 69.7 MB in the beginning and 60.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 30.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.43 ms. Allocated memory is still 90.2 MB. Free memory was 60.2 MB in the beginning and 57.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.43 ms. Allocated memory is still 90.2 MB. Free memory was 57.5 MB in the beginning and 55.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1292.78 ms. Allocated memory was 90.2 MB in the beginning and 111.1 MB in the end (delta: 21.0 MB). Free memory was 55.0 MB in the beginning and 42.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 37.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 21866.23 ms. Allocated memory was 111.1 MB in the beginning and 161.5 MB in the end (delta: 50.3 MB). Free memory was 42.9 MB in the beginning and 37.1 MB in the end (delta: 5.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 16.1 GB. * Witness Printer took 71.52 ms. Allocated memory is still 161.5 MB. Free memory was 37.1 MB in the beginning and 114.4 MB in the end (delta: -77.2 MB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1220 VarBasedMoverChecksPositive, 73 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 51 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 129 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 18.9s, 109 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 26 TransitionsAfterwards, 1738 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 87 TotalNumberOfCompositions, 4356 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1126; [L826] FCALL, FORK 0 pthread_create(&t1126, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L827] 0 pthread_t t1127; [L828] FCALL, FORK 0 pthread_create(&t1127, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L829] 0 pthread_t t1128; [L830] FCALL, FORK 0 pthread_create(&t1128, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L794] 3 z = 1 [L797] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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] [L800] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L762] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] 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) [L803] 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) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L805] 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 [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L807] 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 [L768] 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) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] 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) [L768] 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) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 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 [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 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 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L840] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] 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) [L847] 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) [L848] 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)) [L848] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L848] 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)) [L848] 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)) [L849] 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)) [L849] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L849] 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)) [L849] 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)) [L850] 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)) [L850] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L850] 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)) [L850] 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)) [L851] 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)) [L851] 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) [L851] 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)) [L851] 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)) [L852] 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)) [L852] 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) [L852] 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)) [L852] 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)) [L853] 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)) [L853] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] 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)) [L853] 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)) [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 100 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.9s, HoareTripleCheckerStatistics: 340 SDtfs, 373 SDslu, 666 SDs, 0 SdLazy, 327 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=750occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 145 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 17688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...