./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix055_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_23fc6cb8-3efb-4057-943a-651ca2aaadf1/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_23fc6cb8-3efb-4057-943a-651ca2aaadf1/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_23fc6cb8-3efb-4057-943a-651ca2aaadf1/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_23fc6cb8-3efb-4057-943a-651ca2aaadf1/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix055_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_23fc6cb8-3efb-4057-943a-651ca2aaadf1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_23fc6cb8-3efb-4057-943a-651ca2aaadf1/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 09f8009a58bc9ede20d647ef515335d5ab726e97 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 14:26:14,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 14:26:14,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 14:26:14,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 14:26:14,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 14:26:14,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 14:26:14,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 14:26:14,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 14:26:14,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 14:26:14,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 14:26:14,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 14:26:14,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 14:26:14,544 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 14:26:14,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 14:26:14,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 14:26:14,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 14:26:14,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 14:26:14,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 14:26:14,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 14:26:14,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 14:26:14,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 14:26:14,557 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 14:26:14,558 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 14:26:14,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 14:26:14,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 14:26:14,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 14:26:14,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 14:26:14,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 14:26:14,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 14:26:14,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 14:26:14,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 14:26:14,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 14:26:14,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 14:26:14,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 14:26:14,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 14:26:14,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 14:26:14,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 14:26:14,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 14:26:14,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 14:26:14,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 14:26:14,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 14:26:14,571 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_23fc6cb8-3efb-4057-943a-651ca2aaadf1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 14:26:14,588 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 14:26:14,588 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 14:26:14,588 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 14:26:14,589 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 14:26:14,589 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 14:26:14,589 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 14:26:14,589 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 14:26:14,589 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 14:26:14,589 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 14:26:14,589 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 14:26:14,589 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 14:26:14,590 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 14:26:14,590 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 14:26:14,590 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 14:26:14,590 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 14:26:14,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 14:26:14,591 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 14:26:14,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 14:26:14,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 14:26:14,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 14:26:14,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 14:26:14,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 14:26:14,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 14:26:14,591 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 14:26:14,591 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 14:26:14,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 14:26:14,592 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 14:26:14,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 14:26:14,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 14:26:14,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 14:26:14,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 14:26:14,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 14:26:14,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 14:26:14,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 14:26:14,593 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 14:26:14,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 14:26:14,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 14:26:14,593 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 14:26:14,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 14:26:14,593 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_23fc6cb8-3efb-4057-943a-651ca2aaadf1/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_23fc6cb8-3efb-4057-943a-651ca2aaadf1/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 -> 09f8009a58bc9ede20d647ef515335d5ab726e97 [2020-12-09 14:26:14,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 14:26:14,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 14:26:14,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 14:26:14,768 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 14:26:14,769 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 14:26:14,769 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_23fc6cb8-3efb-4057-943a-651ca2aaadf1/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix055_tso.opt.i [2020-12-09 14:26:14,814 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_23fc6cb8-3efb-4057-943a-651ca2aaadf1/bin/utaipan/data/6e80f2230/2d09e5e0e22d4bf58f5c72b97f8f97db/FLAGbfb54d43e [2020-12-09 14:26:15,229 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 14:26:15,229 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_23fc6cb8-3efb-4057-943a-651ca2aaadf1/sv-benchmarks/c/pthread-wmm/mix055_tso.opt.i [2020-12-09 14:26:15,240 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_23fc6cb8-3efb-4057-943a-651ca2aaadf1/bin/utaipan/data/6e80f2230/2d09e5e0e22d4bf58f5c72b97f8f97db/FLAGbfb54d43e [2020-12-09 14:26:15,250 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_23fc6cb8-3efb-4057-943a-651ca2aaadf1/bin/utaipan/data/6e80f2230/2d09e5e0e22d4bf58f5c72b97f8f97db [2020-12-09 14:26:15,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 14:26:15,252 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 14:26:15,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 14:26:15,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 14:26:15,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 14:26:15,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:26:15" (1/1) ... [2020-12-09 14:26:15,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@436aefc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:26:15, skipping insertion in model container [2020-12-09 14:26:15,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:26:15" (1/1) ... [2020-12-09 14:26:15,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 14:26:15,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 14:26:15,430 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_23fc6cb8-3efb-4057-943a-651ca2aaadf1/sv-benchmarks/c/pthread-wmm/mix055_tso.opt.i[948,961] [2020-12-09 14:26:15,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 14:26:15,586 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 14:26:15,595 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_23fc6cb8-3efb-4057-943a-651ca2aaadf1/sv-benchmarks/c/pthread-wmm/mix055_tso.opt.i[948,961] [2020-12-09 14:26:15,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 14:26:15,723 INFO L208 MainTranslator]: Completed translation [2020-12-09 14:26:15,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:26:15 WrapperNode [2020-12-09 14:26:15,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 14:26:15,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 14:26:15,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 14:26:15,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 14:26:15,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:26:15" (1/1) ... [2020-12-09 14:26:15,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:26:15" (1/1) ... [2020-12-09 14:26:15,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 14:26:15,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 14:26:15,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 14:26:15,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 14:26:15,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:26:15" (1/1) ... [2020-12-09 14:26:15,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:26:15" (1/1) ... [2020-12-09 14:26:15,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:26:15" (1/1) ... [2020-12-09 14:26:15,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:26:15" (1/1) ... [2020-12-09 14:26:15,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:26:15" (1/1) ... [2020-12-09 14:26:15,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:26:15" (1/1) ... [2020-12-09 14:26:15,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:26:15" (1/1) ... [2020-12-09 14:26:15,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 14:26:15,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 14:26:15,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 14:26:15,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 14:26:15,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:26:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_23fc6cb8-3efb-4057-943a-651ca2aaadf1/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 14:26:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 14:26:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 14:26:15,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 14:26:15,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 14:26:15,875 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-09 14:26:15,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-09 14:26:15,875 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-09 14:26:15,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-09 14:26:15,875 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-09 14:26:15,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-09 14:26:15,875 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-12-09 14:26:15,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-12-09 14:26:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 14:26:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 14:26:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 14:26:15,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 14:26:15,877 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 14:26:17,153 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 14:26:17,154 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-09 14:26:17,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:26:17 BoogieIcfgContainer [2020-12-09 14:26:17,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 14:26:17,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 14:26:17,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 14:26:17,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 14:26:17,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:26:15" (1/3) ... [2020-12-09 14:26:17,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca8bc23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:26:17, skipping insertion in model container [2020-12-09 14:26:17,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:26:15" (2/3) ... [2020-12-09 14:26:17,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca8bc23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:26:17, skipping insertion in model container [2020-12-09 14:26:17,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:26:17" (3/3) ... [2020-12-09 14:26:17,164 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_tso.opt.i [2020-12-09 14:26:17,174 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 14:26:17,174 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 14:26:17,177 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 14:26:17,177 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 14:26:17,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,213 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,213 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,213 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,213 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,214 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,214 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,214 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,215 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,216 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,216 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,216 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,216 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,219 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,219 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,219 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,219 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,219 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,220 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,220 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,220 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,224 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,224 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,226 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,226 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,228 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,228 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,229 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,229 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,229 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,230 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,230 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 14:26:17,231 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-09 14:26:17,238 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-09 14:26:17,252 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 14:26:17,252 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 14:26:17,252 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 14:26:17,252 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 14:26:17,252 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 14:26:17,253 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 14:26:17,253 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 14:26:17,253 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 14:26:17,261 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 14:26:17,263 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 246 flow [2020-12-09 14:26:17,265 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 246 flow [2020-12-09 14:26:17,266 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow [2020-12-09 14:26:17,302 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2020-12-09 14:26:17,303 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-09 14:26:17,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2020-12-09 14:26:17,309 INFO L116 LiptonReduction]: Number of co-enabled transitions 2406 [2020-12-09 14:26:17,469 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:17,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:17,471 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:17,471 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:17,474 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:17,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:26:17,478 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 14:26:17,479 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:26:17,508 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:17,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:17,509 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:17,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:17,512 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:17,512 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:26:17,515 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 14:26:17,515 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:26:17,648 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:17,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:17,649 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:17,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:17,681 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 14:26:17,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:17,682 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 14:26:17,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:17,941 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-09 14:26:17,941 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:17,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:17,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:17,975 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:17,976 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,010 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:18,010 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,011 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:18,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,145 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:18,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,147 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:18,147 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,179 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:18,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,181 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:18,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,482 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 14:26:18,482 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,483 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 14:26:18,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,514 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:18,514 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,515 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:18,515 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,544 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:18,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,544 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:18,545 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,574 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:18,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,574 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:18,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,613 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:18,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,613 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:18,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,637 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-12-09 14:26:18,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:18,638 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-12-09 14:26:18,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:18,684 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:18,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:18,689 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 14:26:18,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,691 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 14:26:18,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,694 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 14:26:18,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:26:18,695 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 14:26:18,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:26:18,697 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 14:26:18,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:26:18,700 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-09 14:26:18,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,703 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-09 14:26:18,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,705 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-09 14:26:18,705 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,759 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:18,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,761 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:18,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:18,763 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-09 14:26:18,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:26:18,767 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-09 14:26:18,767 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:19,600 WARN L197 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-12-09 14:26:19,912 WARN L197 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-12-09 14:26:21,353 WARN L197 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 312 DAG size of output: 267 [2020-12-09 14:26:22,002 WARN L197 SmtUtils]: Spent 648.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2020-12-09 14:26:22,013 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:22,013 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:22,013 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:22,014 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:22,035 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:22,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:22,036 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:22,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:22,054 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:22,054 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:22,054 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:22,054 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:22,055 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:22,055 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:26:22,057 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 14:26:22,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:26:22,071 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:22,071 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:22,071 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:22,071 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:22,072 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:22,073 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:26:22,074 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 14:26:22,074 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:26:22,239 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:22,239 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:22,240 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:22,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:22,241 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-09 14:26:22,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:26:22,243 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-09 14:26:22,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:22,269 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:22,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:22,272 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 14:26:22,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:22,272 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 14:26:22,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:22,274 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 14:26:22,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:22,274 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 14:26:22,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:22,276 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 14:26:22,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:22,277 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 14:26:22,277 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:22,278 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 14:26:22,278 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:22,311 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:22,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:22,312 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:22,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:22,330 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:22,330 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:22,330 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:22,331 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:22,515 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-12-09 14:26:22,962 WARN L197 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 90 [2020-12-09 14:26:23,112 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-12-09 14:26:23,226 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 14:26:23,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:23,226 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 14:26:23,227 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:23,248 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:23,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:23,249 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:23,249 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:23,464 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-12-09 14:26:23,464 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:23,465 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-12-09 14:26:23,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:23,479 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:23,479 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:23,480 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:23,480 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:23,500 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:23,501 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:23,501 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:23,501 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:23,517 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-12-09 14:26:23,517 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:23,517 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-12-09 14:26:23,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:23,539 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 14:26:23,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:23,674 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:23,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:23,676 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 14:26:23,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:23,677 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 14:26:23,677 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:23,679 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 14:26:23,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:23,680 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 14:26:23,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:23,681 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 14:26:23,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:23,682 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 14:26:23,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:23,683 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 14:26:23,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:23,720 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:23,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:23,721 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:23,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:23,723 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-09 14:26:23,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:26:23,725 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-09 14:26:23,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:23,880 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 14:26:23,880 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:23,881 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 14:26:23,881 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:23,892 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:23,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:23,892 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:23,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:24,058 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 14:26:24,058 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:24,089 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:24,089 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:24,089 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:24,089 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:24,103 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 14:26:24,103 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:24,104 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 14:26:24,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:24,452 WARN L197 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2020-12-09 14:26:24,811 WARN L197 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2020-12-09 14:26:25,483 WARN L197 SmtUtils]: Spent 670.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2020-12-09 14:26:26,162 WARN L197 SmtUtils]: Spent 677.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2020-12-09 14:26:26,490 WARN L197 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2020-12-09 14:26:26,828 WARN L197 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2020-12-09 14:26:27,489 WARN L197 SmtUtils]: Spent 659.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2020-12-09 14:26:28,173 WARN L197 SmtUtils]: Spent 682.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2020-12-09 14:26:28,324 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:28,324 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:28,324 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:28,324 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:28,344 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 14:26:28,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:28,344 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 14:26:28,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:29,050 WARN L197 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 198 [2020-12-09 14:26:29,448 WARN L197 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2020-12-09 14:26:30,273 WARN L197 SmtUtils]: Spent 823.00 ms on a formula simplification that was a NOOP. DAG size: 277 [2020-12-09 14:26:31,233 WARN L197 SmtUtils]: Spent 959.00 ms on a formula simplification that was a NOOP. DAG size: 277 [2020-12-09 14:26:31,240 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:31,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:31,240 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:31,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:31,241 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:31,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:26:31,242 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 14:26:31,242 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:26:31,253 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:31,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:31,253 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:31,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:31,254 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:31,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:31,255 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 14:26:31,255 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:31,292 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 14:26:31,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:31,292 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 14:26:31,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:31,307 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:31,307 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:31,308 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:31,308 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:31,328 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:31,328 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:31,329 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:31,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:31,343 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:31,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:31,344 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:31,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:31,469 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 14:26:31,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:31,470 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 14:26:31,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:31,488 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:31,489 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:31,489 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:31,489 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:31,505 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:31,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:31,506 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:31,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:31,507 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:31,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:31,508 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 14:26:31,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:31,520 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:31,521 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:31,521 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:31,521 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:31,523 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 14:26:31,523 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:26:31,524 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 14:26:31,524 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:26:31,987 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 14:26:31,987 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:31,987 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 14:26:31,988 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:32,004 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:32,004 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:32,004 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:32,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:32,027 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:32,027 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:32,028 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:32,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:32,043 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 14:26:32,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:32,044 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 14:26:32,044 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:32,064 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:32,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:32,064 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:32,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:32,087 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:32,087 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:32,087 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:32,088 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:32,477 WARN L197 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2020-12-09 14:26:32,853 WARN L197 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 204 [2020-12-09 14:26:34,295 WARN L197 SmtUtils]: Spent 1.44 s on a formula simplification that was a NOOP. DAG size: 285 [2020-12-09 14:26:35,064 WARN L197 SmtUtils]: Spent 766.00 ms on a formula simplification that was a NOOP. DAG size: 283 [2020-12-09 14:26:35,260 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 14:26:35,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:35,261 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 14:26:35,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:26:35,274 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 14:26:35,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:35,275 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 14:26:35,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:26:35,781 WARN L197 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-12-09 14:26:36,000 WARN L197 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-12-09 14:26:36,452 WARN L197 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-12-09 14:26:36,646 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-12-09 14:26:36,680 INFO L131 LiptonReduction]: Checked pairs total: 7069 [2020-12-09 14:26:36,680 INFO L133 LiptonReduction]: Total number of compositions: 94 [2020-12-09 14:26:36,684 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 32 transitions, 84 flow [2020-12-09 14:26:36,785 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-12-09 14:26:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-12-09 14:26:36,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 14:26:36,792 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:26:36,792 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:26:36,792 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 14:26:36,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:26:36,796 INFO L82 PathProgramCache]: Analyzing trace with hash -912097445, now seen corresponding path program 1 times [2020-12-09 14:26:36,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:26:36,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258223014] [2020-12-09 14:26:36,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:26:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:26:36,971 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 14:26:36,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258223014] [2020-12-09 14:26:36,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:26:36,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 14:26:36,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820878833] [2020-12-09 14:26:36,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 14:26:36,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:26:36,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 14:26:36,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 14:26:36,986 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-12-09 14:26:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:26:37,080 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-12-09 14:26:37,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 14:26:37,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-09 14:26:37,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:26:37,109 INFO L225 Difference]: With dead ends: 2202 [2020-12-09 14:26:37,109 INFO L226 Difference]: Without dead ends: 1802 [2020-12-09 14:26:37,110 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 14:26:37,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-12-09 14:26:37,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-12-09 14:26:37,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-12-09 14:26:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-12-09 14:26:37,242 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-12-09 14:26:37,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:26:37,242 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-12-09 14:26:37,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 14:26:37,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-12-09 14:26:37,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 14:26:37,245 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:26:37,245 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:26:37,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 14:26:37,246 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 14:26:37,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:26:37,246 INFO L82 PathProgramCache]: Analyzing trace with hash -352272592, now seen corresponding path program 1 times [2020-12-09 14:26:37,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:26:37,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889461461] [2020-12-09 14:26:37,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:26:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:26:37,359 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 14:26:37,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889461461] [2020-12-09 14:26:37,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:26:37,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 14:26:37,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985877314] [2020-12-09 14:26:37,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 14:26:37,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:26:37,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 14:26:37,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 14:26:37,362 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-12-09 14:26:37,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:26:37,403 INFO L93 Difference]: Finished difference Result 1752 states and 6554 transitions. [2020-12-09 14:26:37,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 14:26:37,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-09 14:26:37,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:26:37,421 INFO L225 Difference]: With dead ends: 1752 [2020-12-09 14:26:37,422 INFO L226 Difference]: Without dead ends: 1752 [2020-12-09 14:26:37,422 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 14:26:37,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2020-12-09 14:26:37,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2020-12-09 14:26:37,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2020-12-09 14:26:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 6554 transitions. [2020-12-09 14:26:37,494 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 6554 transitions. Word has length 11 [2020-12-09 14:26:37,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:26:37,494 INFO L481 AbstractCegarLoop]: Abstraction has 1752 states and 6554 transitions. [2020-12-09 14:26:37,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 14:26:37,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 6554 transitions. [2020-12-09 14:26:37,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 14:26:37,497 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:26:37,497 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:26:37,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 14:26:37,497 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 14:26:37,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:26:37,498 INFO L82 PathProgramCache]: Analyzing trace with hash 412376529, now seen corresponding path program 1 times [2020-12-09 14:26:37,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:26:37,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84032544] [2020-12-09 14:26:37,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:26:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:26:37,634 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 14:26:37,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84032544] [2020-12-09 14:26:37,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:26:37,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 14:26:37,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926227636] [2020-12-09 14:26:37,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 14:26:37,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:26:37,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 14:26:37,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 14:26:37,636 INFO L87 Difference]: Start difference. First operand 1752 states and 6554 transitions. Second operand 4 states. [2020-12-09 14:26:37,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:26:37,692 INFO L93 Difference]: Finished difference Result 1724 states and 6430 transitions. [2020-12-09 14:26:37,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 14:26:37,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-09 14:26:37,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:26:37,705 INFO L225 Difference]: With dead ends: 1724 [2020-12-09 14:26:37,705 INFO L226 Difference]: Without dead ends: 1724 [2020-12-09 14:26:37,705 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 14:26:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2020-12-09 14:26:37,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1724. [2020-12-09 14:26:37,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2020-12-09 14:26:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 6430 transitions. [2020-12-09 14:26:37,750 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 6430 transitions. Word has length 12 [2020-12-09 14:26:37,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:26:37,750 INFO L481 AbstractCegarLoop]: Abstraction has 1724 states and 6430 transitions. [2020-12-09 14:26:37,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 14:26:37,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 6430 transitions. [2020-12-09 14:26:37,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 14:26:37,751 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:26:37,751 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:26:37,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 14:26:37,752 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 14:26:37,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:26:37,752 INFO L82 PathProgramCache]: Analyzing trace with hash -101261429, now seen corresponding path program 1 times [2020-12-09 14:26:37,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:26:37,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303036512] [2020-12-09 14:26:37,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:26:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:26:37,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:26:37,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303036512] [2020-12-09 14:26:37,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:26:37,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 14:26:37,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305121561] [2020-12-09 14:26:37,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 14:26:37,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:26:37,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 14:26:37,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 14:26:37,915 INFO L87 Difference]: Start difference. First operand 1724 states and 6430 transitions. Second operand 5 states. [2020-12-09 14:26:38,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:26:38,003 INFO L93 Difference]: Finished difference Result 1668 states and 6182 transitions. [2020-12-09 14:26:38,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 14:26:38,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-09 14:26:38,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:26:38,016 INFO L225 Difference]: With dead ends: 1668 [2020-12-09 14:26:38,016 INFO L226 Difference]: Without dead ends: 1668 [2020-12-09 14:26:38,016 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 14:26:38,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2020-12-09 14:26:38,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1668. [2020-12-09 14:26:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2020-12-09 14:26:38,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 6182 transitions. [2020-12-09 14:26:38,058 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 6182 transitions. Word has length 13 [2020-12-09 14:26:38,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:26:38,058 INFO L481 AbstractCegarLoop]: Abstraction has 1668 states and 6182 transitions. [2020-12-09 14:26:38,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 14:26:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 6182 transitions. [2020-12-09 14:26:38,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 14:26:38,060 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:26:38,060 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:26:38,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 14:26:38,060 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 14:26:38,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:26:38,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1292454723, now seen corresponding path program 1 times [2020-12-09 14:26:38,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:26:38,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302407903] [2020-12-09 14:26:38,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:26:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:26:38,198 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 14:26:38,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302407903] [2020-12-09 14:26:38,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:26:38,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 14:26:38,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168313274] [2020-12-09 14:26:38,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 14:26:38,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:26:38,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 14:26:38,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 14:26:38,199 INFO L87 Difference]: Start difference. First operand 1668 states and 6182 transitions. Second operand 5 states. [2020-12-09 14:26:38,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:26:38,272 INFO L93 Difference]: Finished difference Result 1626 states and 6010 transitions. [2020-12-09 14:26:38,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 14:26:38,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-12-09 14:26:38,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:26:38,288 INFO L225 Difference]: With dead ends: 1626 [2020-12-09 14:26:38,288 INFO L226 Difference]: Without dead ends: 1626 [2020-12-09 14:26:38,288 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 14:26:38,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2020-12-09 14:26:38,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1626. [2020-12-09 14:26:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1626 states. [2020-12-09 14:26:38,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 6010 transitions. [2020-12-09 14:26:38,334 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 6010 transitions. Word has length 14 [2020-12-09 14:26:38,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:26:38,334 INFO L481 AbstractCegarLoop]: Abstraction has 1626 states and 6010 transitions. [2020-12-09 14:26:38,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 14:26:38,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 6010 transitions. [2020-12-09 14:26:38,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 14:26:38,336 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:26:38,336 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:26:38,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 14:26:38,336 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 14:26:38,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:26:38,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1411358809, now seen corresponding path program 1 times [2020-12-09 14:26:38,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:26:38,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114686935] [2020-12-09 14:26:38,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:26:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:26:38,465 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 14:26:38,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114686935] [2020-12-09 14:26:38,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:26:38,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 14:26:38,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094755607] [2020-12-09 14:26:38,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 14:26:38,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:26:38,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 14:26:38,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 14:26:38,466 INFO L87 Difference]: Start difference. First operand 1626 states and 6010 transitions. Second operand 6 states. [2020-12-09 14:26:38,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:26:38,550 INFO L93 Difference]: Finished difference Result 1738 states and 6466 transitions. [2020-12-09 14:26:38,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 14:26:38,551 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-09 14:26:38,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:26:38,564 INFO L225 Difference]: With dead ends: 1738 [2020-12-09 14:26:38,564 INFO L226 Difference]: Without dead ends: 1738 [2020-12-09 14:26:38,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 14:26:38,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2020-12-09 14:26:38,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1738. [2020-12-09 14:26:38,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2020-12-09 14:26:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 6466 transitions. [2020-12-09 14:26:38,609 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 6466 transitions. Word has length 15 [2020-12-09 14:26:38,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:26:38,609 INFO L481 AbstractCegarLoop]: Abstraction has 1738 states and 6466 transitions. [2020-12-09 14:26:38,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 14:26:38,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 6466 transitions. [2020-12-09 14:26:38,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 14:26:38,611 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:26:38,611 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:26:38,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 14:26:38,611 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 14:26:38,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:26:38,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1411390429, now seen corresponding path program 2 times [2020-12-09 14:26:38,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:26:38,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970908245] [2020-12-09 14:26:38,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:26:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:26:38,721 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 14:26:38,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970908245] [2020-12-09 14:26:38,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:26:38,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 14:26:38,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702373982] [2020-12-09 14:26:38,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 14:26:38,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:26:38,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 14:26:38,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 14:26:38,722 INFO L87 Difference]: Start difference. First operand 1738 states and 6466 transitions. Second operand 6 states. [2020-12-09 14:26:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:26:38,837 INFO L93 Difference]: Finished difference Result 1902 states and 7046 transitions. [2020-12-09 14:26:38,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 14:26:38,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-09 14:26:38,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:26:38,849 INFO L225 Difference]: With dead ends: 1902 [2020-12-09 14:26:38,849 INFO L226 Difference]: Without dead ends: 1902 [2020-12-09 14:26:38,849 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-12-09 14:26:38,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2020-12-09 14:26:38,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1790. [2020-12-09 14:26:38,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1790 states. [2020-12-09 14:26:38,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 6590 transitions. [2020-12-09 14:26:38,898 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 6590 transitions. Word has length 15 [2020-12-09 14:26:38,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:26:38,898 INFO L481 AbstractCegarLoop]: Abstraction has 1790 states and 6590 transitions. [2020-12-09 14:26:38,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 14:26:38,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 6590 transitions. [2020-12-09 14:26:38,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 14:26:38,900 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:26:38,901 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:26:38,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 14:26:38,901 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 14:26:38,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:26:38,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1469517324, now seen corresponding path program 1 times [2020-12-09 14:26:38,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:26:38,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326990439] [2020-12-09 14:26:38,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:26:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:26:38,952 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 14:26:38,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326990439] [2020-12-09 14:26:38,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:26:38,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 14:26:38,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081082377] [2020-12-09 14:26:38,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 14:26:38,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:26:38,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 14:26:38,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 14:26:38,953 INFO L87 Difference]: Start difference. First operand 1790 states and 6590 transitions. Second operand 4 states. [2020-12-09 14:26:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:26:38,990 INFO L93 Difference]: Finished difference Result 1888 states and 6354 transitions. [2020-12-09 14:26:38,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 14:26:38,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-09 14:26:38,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:26:38,999 INFO L225 Difference]: With dead ends: 1888 [2020-12-09 14:26:38,999 INFO L226 Difference]: Without dead ends: 1424 [2020-12-09 14:26:38,999 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 14:26:39,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-12-09 14:26:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1424. [2020-12-09 14:26:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1424 states. [2020-12-09 14:26:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 4760 transitions. [2020-12-09 14:26:39,026 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 4760 transitions. Word has length 15 [2020-12-09 14:26:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:26:39,026 INFO L481 AbstractCegarLoop]: Abstraction has 1424 states and 4760 transitions. [2020-12-09 14:26:39,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 14:26:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 4760 transitions. [2020-12-09 14:26:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 14:26:39,028 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:26:39,028 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:26:39,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 14:26:39,028 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 14:26:39,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:26:39,028 INFO L82 PathProgramCache]: Analyzing trace with hash -826164798, now seen corresponding path program 1 times [2020-12-09 14:26:39,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:26:39,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375451561] [2020-12-09 14:26:39,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:26:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:26:39,085 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 14:26:39,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375451561] [2020-12-09 14:26:39,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:26:39,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 14:26:39,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387661389] [2020-12-09 14:26:39,086 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 14:26:39,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:26:39,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 14:26:39,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 14:26:39,087 INFO L87 Difference]: Start difference. First operand 1424 states and 4760 transitions. Second operand 5 states. [2020-12-09 14:26:39,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:26:39,139 INFO L93 Difference]: Finished difference Result 1245 states and 3818 transitions. [2020-12-09 14:26:39,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 14:26:39,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-09 14:26:39,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:26:39,143 INFO L225 Difference]: With dead ends: 1245 [2020-12-09 14:26:39,143 INFO L226 Difference]: Without dead ends: 943 [2020-12-09 14:26:39,143 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 14:26:39,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2020-12-09 14:26:39,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2020-12-09 14:26:39,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2020-12-09 14:26:39,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2836 transitions. [2020-12-09 14:26:39,160 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2836 transitions. Word has length 16 [2020-12-09 14:26:39,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:26:39,160 INFO L481 AbstractCegarLoop]: Abstraction has 943 states and 2836 transitions. [2020-12-09 14:26:39,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 14:26:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2836 transitions. [2020-12-09 14:26:39,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 14:26:39,162 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:26:39,162 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:26:39,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 14:26:39,162 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 14:26:39,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:26:39,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1605014085, now seen corresponding path program 1 times [2020-12-09 14:26:39,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:26:39,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827756958] [2020-12-09 14:26:39,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:26:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:26:39,205 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 14:26:39,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827756958] [2020-12-09 14:26:39,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:26:39,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 14:26:39,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115656943] [2020-12-09 14:26:39,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 14:26:39,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:26:39,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 14:26:39,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 14:26:39,206 INFO L87 Difference]: Start difference. First operand 943 states and 2836 transitions. Second operand 4 states. [2020-12-09 14:26:39,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:26:39,226 INFO L93 Difference]: Finished difference Result 1294 states and 3807 transitions. [2020-12-09 14:26:39,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 14:26:39,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-12-09 14:26:39,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:26:39,230 INFO L225 Difference]: With dead ends: 1294 [2020-12-09 14:26:39,230 INFO L226 Difference]: Without dead ends: 840 [2020-12-09 14:26:39,230 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 14:26:39,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2020-12-09 14:26:39,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 819. [2020-12-09 14:26:39,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2020-12-09 14:26:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2322 transitions. [2020-12-09 14:26:39,245 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2322 transitions. Word has length 18 [2020-12-09 14:26:39,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:26:39,245 INFO L481 AbstractCegarLoop]: Abstraction has 819 states and 2322 transitions. [2020-12-09 14:26:39,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 14:26:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2322 transitions. [2020-12-09 14:26:39,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 14:26:39,247 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:26:39,247 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:26:39,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 14:26:39,247 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 14:26:39,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:26:39,247 INFO L82 PathProgramCache]: Analyzing trace with hash 555674645, now seen corresponding path program 1 times [2020-12-09 14:26:39,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:26:39,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575212443] [2020-12-09 14:26:39,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:26:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:26:39,302 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 14:26:39,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575212443] [2020-12-09 14:26:39,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:26:39,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 14:26:39,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223404959] [2020-12-09 14:26:39,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 14:26:39,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:26:39,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 14:26:39,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 14:26:39,303 INFO L87 Difference]: Start difference. First operand 819 states and 2322 transitions. Second operand 6 states. [2020-12-09 14:26:39,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:26:39,355 INFO L93 Difference]: Finished difference Result 704 states and 1957 transitions. [2020-12-09 14:26:39,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 14:26:39,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-09 14:26:39,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:26:39,358 INFO L225 Difference]: With dead ends: 704 [2020-12-09 14:26:39,359 INFO L226 Difference]: Without dead ends: 614 [2020-12-09 14:26:39,359 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 14:26:39,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-12-09 14:26:39,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2020-12-09 14:26:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2020-12-09 14:26:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1731 transitions. [2020-12-09 14:26:39,375 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 1731 transitions. Word has length 18 [2020-12-09 14:26:39,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:26:39,375 INFO L481 AbstractCegarLoop]: Abstraction has 614 states and 1731 transitions. [2020-12-09 14:26:39,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 14:26:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1731 transitions. [2020-12-09 14:26:39,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 14:26:39,377 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:26:39,377 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 14:26:39,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 14:26:39,377 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 14:26:39,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:26:39,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1794741835, now seen corresponding path program 1 times [2020-12-09 14:26:39,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:26:39,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875161692] [2020-12-09 14:26:39,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:26:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:26:39,411 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 14:26:39,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875161692] [2020-12-09 14:26:39,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:26:39,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 14:26:39,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610695087] [2020-12-09 14:26:39,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 14:26:39,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:26:39,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 14:26:39,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 14:26:39,412 INFO L87 Difference]: Start difference. First operand 614 states and 1731 transitions. Second operand 3 states. [2020-12-09 14:26:39,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:26:39,425 INFO L93 Difference]: Finished difference Result 837 states and 2281 transitions. [2020-12-09 14:26:39,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 14:26:39,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-12-09 14:26:39,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:26:39,427 INFO L225 Difference]: With dead ends: 837 [2020-12-09 14:26:39,427 INFO L226 Difference]: Without dead ends: 567 [2020-12-09 14:26:39,427 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 14:26:39,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-12-09 14:26:39,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 547. [2020-12-09 14:26:39,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2020-12-09 14:26:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1424 transitions. [2020-12-09 14:26:39,436 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1424 transitions. Word has length 21 [2020-12-09 14:26:39,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:26:39,437 INFO L481 AbstractCegarLoop]: Abstraction has 547 states and 1424 transitions. [2020-12-09 14:26:39,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 14:26:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1424 transitions. [2020-12-09 14:26:39,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 14:26:39,438 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:26:39,438 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 14:26:39,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 14:26:39,438 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 14:26:39,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:26:39,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1079089743, now seen corresponding path program 2 times [2020-12-09 14:26:39,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:26:39,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459214117] [2020-12-09 14:26:39,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:26:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:26:39,500 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 14:26:39,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459214117] [2020-12-09 14:26:39,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:26:39,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 14:26:39,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198697229] [2020-12-09 14:26:39,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 14:26:39,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:26:39,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 14:26:39,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 14:26:39,501 INFO L87 Difference]: Start difference. First operand 547 states and 1424 transitions. Second operand 7 states. [2020-12-09 14:26:39,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:26:39,565 INFO L93 Difference]: Finished difference Result 522 states and 1374 transitions. [2020-12-09 14:26:39,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 14:26:39,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-12-09 14:26:39,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:26:39,566 INFO L225 Difference]: With dead ends: 522 [2020-12-09 14:26:39,566 INFO L226 Difference]: Without dead ends: 201 [2020-12-09 14:26:39,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-12-09 14:26:39,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-12-09 14:26:39,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 179. [2020-12-09 14:26:39,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-12-09 14:26:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 445 transitions. [2020-12-09 14:26:39,569 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 445 transitions. Word has length 21 [2020-12-09 14:26:39,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:26:39,569 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 445 transitions. [2020-12-09 14:26:39,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 14:26:39,569 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 445 transitions. [2020-12-09 14:26:39,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 14:26:39,570 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:26:39,570 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:26:39,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 14:26:39,570 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 14:26:39,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:26:39,571 INFO L82 PathProgramCache]: Analyzing trace with hash 789816242, now seen corresponding path program 1 times [2020-12-09 14:26:39,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:26:39,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496058371] [2020-12-09 14:26:39,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:26:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:26:39,630 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 14:26:39,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496058371] [2020-12-09 14:26:39,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:26:39,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 14:26:39,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055684102] [2020-12-09 14:26:39,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 14:26:39,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:26:39,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 14:26:39,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 14:26:39,631 INFO L87 Difference]: Start difference. First operand 179 states and 445 transitions. Second operand 4 states. [2020-12-09 14:26:39,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:26:39,649 INFO L93 Difference]: Finished difference Result 229 states and 563 transitions. [2020-12-09 14:26:39,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 14:26:39,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-12-09 14:26:39,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:26:39,651 INFO L225 Difference]: With dead ends: 229 [2020-12-09 14:26:39,651 INFO L226 Difference]: Without dead ends: 91 [2020-12-09 14:26:39,651 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 14:26:39,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-12-09 14:26:39,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-12-09 14:26:39,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-12-09 14:26:39,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 197 transitions. [2020-12-09 14:26:39,654 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 197 transitions. Word has length 25 [2020-12-09 14:26:39,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:26:39,654 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 197 transitions. [2020-12-09 14:26:39,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 14:26:39,654 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 197 transitions. [2020-12-09 14:26:39,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 14:26:39,655 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:26:39,655 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:26:39,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 14:26:39,655 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 14:26:39,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:26:39,655 INFO L82 PathProgramCache]: Analyzing trace with hash 76613324, now seen corresponding path program 2 times [2020-12-09 14:26:39,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:26:39,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899716250] [2020-12-09 14:26:39,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:26:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:26:39,882 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 14:26:39,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899716250] [2020-12-09 14:26:39,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:26:39,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 14:26:39,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255918688] [2020-12-09 14:26:39,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 14:26:39,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:26:39,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 14:26:39,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-09 14:26:39,884 INFO L87 Difference]: Start difference. First operand 91 states and 197 transitions. Second operand 8 states. [2020-12-09 14:26:40,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:26:40,032 INFO L93 Difference]: Finished difference Result 136 states and 286 transitions. [2020-12-09 14:26:40,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 14:26:40,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-12-09 14:26:40,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:26:40,034 INFO L225 Difference]: With dead ends: 136 [2020-12-09 14:26:40,034 INFO L226 Difference]: Without dead ends: 82 [2020-12-09 14:26:40,035 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-09 14:26:40,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-12-09 14:26:40,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2020-12-09 14:26:40,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-09 14:26:40,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 121 transitions. [2020-12-09 14:26:40,036 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 121 transitions. Word has length 25 [2020-12-09 14:26:40,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:26:40,037 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 121 transitions. [2020-12-09 14:26:40,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 14:26:40,037 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 121 transitions. [2020-12-09 14:26:40,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 14:26:40,037 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:26:40,037 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:26:40,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-09 14:26:40,038 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 14:26:40,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:26:40,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1781839022, now seen corresponding path program 3 times [2020-12-09 14:26:40,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:26:40,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044841375] [2020-12-09 14:26:40,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:26:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 14:26:40,084 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 14:26:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 14:26:40,115 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 14:26:40,150 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 14:26:40,150 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 14:26:40,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-09 14:26:40,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:26:40 BasicIcfg [2020-12-09 14:26:40,229 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 14:26:40,230 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 14:26:40,230 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 14:26:40,230 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 14:26:40,230 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:26:17" (3/4) ... [2020-12-09 14:26:40,231 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 14:26:40,303 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_23fc6cb8-3efb-4057-943a-651ca2aaadf1/bin/utaipan/witness.graphml [2020-12-09 14:26:40,303 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 14:26:40,304 INFO L168 Benchmark]: Toolchain (without parser) took 25050.81 ms. Allocated memory was 119.5 MB in the beginning and 264.2 MB in the end (delta: 144.7 MB). Free memory was 88.8 MB in the beginning and 207.7 MB in the end (delta: -118.9 MB). Peak memory consumption was 132.2 MB. Max. memory is 16.1 GB. [2020-12-09 14:26:40,304 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 73.4 MB. Free memory was 39.4 MB in the beginning and 39.4 MB in the end (delta: 56.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 14:26:40,304 INFO L168 Benchmark]: CACSL2BoogieTranslator took 473.57 ms. Allocated memory is still 119.5 MB. Free memory was 88.5 MB in the beginning and 95.2 MB in the end (delta: -6.6 MB). Peak memory consumption was 38.2 MB. Max. memory is 16.1 GB. [2020-12-09 14:26:40,304 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.12 ms. Allocated memory is still 119.5 MB. Free memory was 95.2 MB in the beginning and 92.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 14:26:40,305 INFO L168 Benchmark]: Boogie Preprocessor took 33.42 ms. Allocated memory is still 119.5 MB. Free memory was 92.3 MB in the beginning and 90.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 14:26:40,305 INFO L168 Benchmark]: RCFGBuilder took 1346.34 ms. Allocated memory was 119.5 MB in the beginning and 151.0 MB in the end (delta: 31.5 MB). Free memory was 90.2 MB in the beginning and 66.4 MB in the end (delta: 23.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 16.1 GB. [2020-12-09 14:26:40,305 INFO L168 Benchmark]: TraceAbstraction took 23071.80 ms. Allocated memory was 151.0 MB in the beginning and 220.2 MB in the end (delta: 69.2 MB). Free memory was 65.3 MB in the beginning and 61.0 MB in the end (delta: 4.3 MB). Peak memory consumption was 73.5 MB. Max. memory is 16.1 GB. [2020-12-09 14:26:40,305 INFO L168 Benchmark]: Witness Printer took 73.40 ms. Allocated memory was 220.2 MB in the beginning and 264.2 MB in the end (delta: 44.0 MB). Free memory was 61.0 MB in the beginning and 207.7 MB in the end (delta: -146.6 MB). Peak memory consumption was 2.3 MB. Max. memory is 16.1 GB. [2020-12-09 14:26:40,307 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 73.4 MB. Free memory was 39.4 MB in the beginning and 39.4 MB in the end (delta: 56.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 473.57 ms. Allocated memory is still 119.5 MB. Free memory was 88.5 MB in the beginning and 95.2 MB in the end (delta: -6.6 MB). Peak memory consumption was 38.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 47.12 ms. Allocated memory is still 119.5 MB. Free memory was 95.2 MB in the beginning and 92.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.42 ms. Allocated memory is still 119.5 MB. Free memory was 92.3 MB in the beginning and 90.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1346.34 ms. Allocated memory was 119.5 MB in the beginning and 151.0 MB in the end (delta: 31.5 MB). Free memory was 90.2 MB in the beginning and 66.4 MB in the end (delta: 23.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 23071.80 ms. Allocated memory was 151.0 MB in the beginning and 220.2 MB in the end (delta: 69.2 MB). Free memory was 65.3 MB in the beginning and 61.0 MB in the end (delta: 4.3 MB). Peak memory consumption was 73.5 MB. Max. memory is 16.1 GB. * Witness Printer took 73.40 ms. Allocated memory was 220.2 MB in the beginning and 264.2 MB in the end (delta: 44.0 MB). Free memory was 61.0 MB in the beginning and 207.7 MB in the end (delta: -146.6 MB). Peak memory consumption was 2.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1789 VarBasedMoverChecksPositive, 96 VarBasedMoverChecksNegative, 39 SemBasedMoverChecksPositive, 57 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 217 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 19.4s, 124 PlacesBefore, 44 PlacesAfterwards, 113 TransitionsBefore, 32 TransitionsAfterwards, 2406 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 94 TotalNumberOfCompositions, 7069 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1485; [L837] FCALL, FORK 0 pthread_create(&t1485, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1486; [L839] FCALL, FORK 0 pthread_create(&t1486, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1487; [L841] FCALL, FORK 0 pthread_create(&t1487, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t1488; [L843] FCALL, FORK 0 pthread_create(&t1488, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L766] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L784] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 112 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 22.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 19.5s, HoareTripleCheckerStatistics: 477 SDtfs, 466 SDslu, 844 SDs, 0 SdLazy, 360 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred 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.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 194 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 28175 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...