./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_pso.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_13574c16-6529-4cc9-8305-ab427415177f/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_13574c16-6529-4cc9-8305-ab427415177f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_13574c16-6529-4cc9-8305-ab427415177f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_13574c16-6529-4cc9-8305-ab427415177f/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_13574c16-6529-4cc9-8305-ab427415177f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_13574c16-6529-4cc9-8305-ab427415177f/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 75a4e7496cbd7651ffdccc52e29d27dc704d7a21 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 10:58:12,167 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 10:58:12,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 10:58:12,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 10:58:12,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 10:58:12,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 10:58:12,200 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 10:58:12,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 10:58:12,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 10:58:12,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 10:58:12,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 10:58:12,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 10:58:12,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 10:58:12,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 10:58:12,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 10:58:12,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 10:58:12,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 10:58:12,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 10:58:12,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 10:58:12,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 10:58:12,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 10:58:12,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 10:58:12,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 10:58:12,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 10:58:12,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 10:58:12,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 10:58:12,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 10:58:12,227 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 10:58:12,227 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 10:58:12,228 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 10:58:12,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 10:58:12,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 10:58:12,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 10:58:12,231 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 10:58:12,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 10:58:12,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 10:58:12,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 10:58:12,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 10:58:12,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 10:58:12,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 10:58:12,233 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 10:58:12,234 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_13574c16-6529-4cc9-8305-ab427415177f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 10:58:12,255 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 10:58:12,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 10:58:12,256 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 10:58:12,256 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 10:58:12,256 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 10:58:12,256 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 10:58:12,256 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 10:58:12,257 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 10:58:12,257 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 10:58:12,257 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 10:58:12,257 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 10:58:12,257 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 10:58:12,258 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 10:58:12,258 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 10:58:12,258 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 10:58:12,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 10:58:12,259 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 10:58:12,259 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 10:58:12,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 10:58:12,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 10:58:12,259 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 10:58:12,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 10:58:12,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 10:58:12,260 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 10:58:12,260 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 10:58:12,260 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 10:58:12,260 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 10:58:12,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 10:58:12,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 10:58:12,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 10:58:12,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 10:58:12,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 10:58:12,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 10:58:12,262 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 10:58:12,262 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 10:58:12,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 10:58:12,262 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 10:58:12,262 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 10:58:12,263 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 10:58:12,263 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_13574c16-6529-4cc9-8305-ab427415177f/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_13574c16-6529-4cc9-8305-ab427415177f/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 -> 75a4e7496cbd7651ffdccc52e29d27dc704d7a21 [2020-12-09 10:58:12,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 10:58:12,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 10:58:12,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 10:58:12,454 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 10:58:12,455 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 10:58:12,456 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_13574c16-6529-4cc9-8305-ab427415177f/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe029_pso.opt.i [2020-12-09 10:58:12,495 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_13574c16-6529-4cc9-8305-ab427415177f/bin/utaipan/data/0ba885af6/75e0a58d4a6d44ccbd691573a4ebdb77/FLAG195765c87 [2020-12-09 10:58:12,931 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 10:58:12,932 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_13574c16-6529-4cc9-8305-ab427415177f/sv-benchmarks/c/pthread-wmm/safe029_pso.opt.i [2020-12-09 10:58:12,944 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_13574c16-6529-4cc9-8305-ab427415177f/bin/utaipan/data/0ba885af6/75e0a58d4a6d44ccbd691573a4ebdb77/FLAG195765c87 [2020-12-09 10:58:12,956 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_13574c16-6529-4cc9-8305-ab427415177f/bin/utaipan/data/0ba885af6/75e0a58d4a6d44ccbd691573a4ebdb77 [2020-12-09 10:58:12,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 10:58:12,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 10:58:12,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 10:58:12,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 10:58:12,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 10:58:12,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:58:12" (1/1) ... [2020-12-09 10:58:12,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a6e740c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:58:12, skipping insertion in model container [2020-12-09 10:58:12,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:58:12" (1/1) ... [2020-12-09 10:58:12,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 10:58:13,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 10:58:13,128 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_13574c16-6529-4cc9-8305-ab427415177f/sv-benchmarks/c/pthread-wmm/safe029_pso.opt.i[949,962] [2020-12-09 10:58:13,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 10:58:13,256 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 10:58:13,267 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_13574c16-6529-4cc9-8305-ab427415177f/sv-benchmarks/c/pthread-wmm/safe029_pso.opt.i[949,962] [2020-12-09 10:58:13,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 10:58:13,357 INFO L208 MainTranslator]: Completed translation [2020-12-09 10:58:13,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:58:13 WrapperNode [2020-12-09 10:58:13,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 10:58:13,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 10:58:13,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 10:58:13,358 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 10:58:13,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:58:13" (1/1) ... [2020-12-09 10:58:13,381 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:58:13" (1/1) ... [2020-12-09 10:58:13,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 10:58:13,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 10:58:13,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 10:58:13,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 10:58:13,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:58:13" (1/1) ... [2020-12-09 10:58:13,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:58:13" (1/1) ... [2020-12-09 10:58:13,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:58:13" (1/1) ... [2020-12-09 10:58:13,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:58:13" (1/1) ... [2020-12-09 10:58:13,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:58:13" (1/1) ... [2020-12-09 10:58:13,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:58:13" (1/1) ... [2020-12-09 10:58:13,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:58:13" (1/1) ... [2020-12-09 10:58:13,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 10:58:13,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 10:58:13,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 10:58:13,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 10:58:13,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:58:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_13574c16-6529-4cc9-8305-ab427415177f/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 10:58:13,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 10:58:13,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 10:58:13,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 10:58:13,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 10:58:13,507 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-09 10:58:13,507 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-09 10:58:13,507 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-09 10:58:13,507 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-09 10:58:13,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 10:58:13,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 10:58:13,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 10:58:13,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 10:58:13,509 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-09 10:58:14,766 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 10:58:14,766 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-09 10:58:14,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:58:14 BoogieIcfgContainer [2020-12-09 10:58:14,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 10:58:14,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 10:58:14,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 10:58:14,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 10:58:14,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 10:58:12" (1/3) ... [2020-12-09 10:58:14,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d631ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:58:14, skipping insertion in model container [2020-12-09 10:58:14,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:58:13" (2/3) ... [2020-12-09 10:58:14,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d631ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:58:14, skipping insertion in model container [2020-12-09 10:58:14,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:58:14" (3/3) ... [2020-12-09 10:58:14,773 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_pso.opt.i [2020-12-09 10:58:14,783 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 10:58:14,783 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 10:58:14,786 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 10:58:14,786 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 10:58:14,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,815 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,815 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,816 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,816 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,820 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,820 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,821 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,821 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,821 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,822 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,822 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,822 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,829 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,829 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,831 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,831 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,831 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:58:14,834 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-09 10:58:14,844 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-12-09 10:58:14,860 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 10:58:14,860 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 10:58:14,860 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 10:58:14,860 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 10:58:14,860 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 10:58:14,860 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 10:58:14,860 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 10:58:14,860 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 10:58:14,868 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 10:58:14,869 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 79 transitions, 168 flow [2020-12-09 10:58:14,871 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 79 transitions, 168 flow [2020-12-09 10:58:14,873 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow [2020-12-09 10:58:14,901 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2020-12-09 10:58:14,901 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-09 10:58:14,903 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2020-12-09 10:58:14,905 INFO L116 LiptonReduction]: Number of co-enabled transitions 918 [2020-12-09 10:58:15,193 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 2, 1] term [2020-12-09 10:58:15,194 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:15,195 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:58:15,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:15,240 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:15,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:15,242 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:58:15,242 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:15,260 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-09 10:58:15,260 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:15,262 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2020-12-09 10:58:15,262 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:15,263 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-09 10:58:15,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:15,309 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:15,310 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:15,311 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:58:15,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:15,345 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 10:58:15,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:15,346 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 10:58:15,347 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:15,439 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:15,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:15,440 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:58:15,440 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:15,465 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 10:58:15,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:15,466 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 10:58:15,466 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:15,526 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:15,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:15,536 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:58:15,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:15,537 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:15,537 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:15,541 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:15,542 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:58:15,543 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:15,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:58:15,545 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:15,546 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:58:15,549 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:58:15,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:15,552 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:58:15,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:15,555 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:58:15,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:15,616 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:15,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:15,617 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:58:15,617 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:15,620 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 10:58:15,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:58:15,623 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 10:58:15,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:15,883 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-09 10:58:16,346 WARN L197 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2020-12-09 10:58:16,473 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-12-09 10:58:16,693 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:16,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:16,694 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:58:16,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:16,695 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 10:58:16,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:58:16,698 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 10:58:16,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:16,744 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:16,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:16,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:58:16,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:16,749 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:16,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:16,751 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:16,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:58:16,752 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:16,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:58:16,753 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:16,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:58:16,755 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:58:16,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:16,757 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:58:16,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:16,758 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:58:16,758 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:16,842 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:16,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:16,843 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:58:16,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:16,844 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 10:58:16,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:58:16,846 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 10:58:16,846 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:16,883 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:16,884 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:16,885 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:58:16,885 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:16,885 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:16,886 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:16,887 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:16,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:58:16,888 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:16,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:58:16,890 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:16,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:58:16,891 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:58:16,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:16,892 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:58:16,893 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:16,901 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:58:16,902 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:16,967 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 10:58:16,967 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:16,967 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 10:58:16,968 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:16,986 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:16,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:16,987 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:58:16,987 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:17,025 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:17,027 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,027 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:17,028 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:17,029 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,030 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:58:17,030 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,031 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:58:17,031 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,032 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:58:17,033 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,034 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:17,035 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,035 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:17,036 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:17,070 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:17,070 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:17,070 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:58:17,071 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:17,072 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 10:58:17,072 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:58:17,074 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 10:58:17,074 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:17,248 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:17,249 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,249 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:17,251 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,251 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:58:17,253 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:58:17,267 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,267 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:17,267 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:17,269 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:58:17,270 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:58:17,542 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,542 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:17,543 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,543 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:17,544 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:58:17,545 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,545 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:58:17,556 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:17,557 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:17,558 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:17,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:17,559 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 10:58:17,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:17,936 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-12-09 10:58:18,087 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-12-09 10:58:18,114 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:18,114 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:18,114 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:18,115 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:18,115 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:18,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:18,116 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 10:58:18,117 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:18,129 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:18,129 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:18,130 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:18,130 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:18,132 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:18,132 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:58:18,133 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:18,134 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:58:18,179 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:18,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:18,180 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:18,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:18,181 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:18,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:58:18,182 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:18,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:58:18,195 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:18,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:18,196 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:18,196 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:18,197 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:18,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:58:18,198 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:58:18,198 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:58:18,297 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 10:58:18,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:18,298 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 10:58:18,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:18,319 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:18,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:18,320 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:58:18,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:19,200 WARN L197 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-12-09 10:58:19,579 WARN L197 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-12-09 10:58:21,249 WARN L197 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2020-12-09 10:58:21,906 WARN L197 SmtUtils]: Spent 656.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2020-12-09 10:58:22,187 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 2, 1] term [2020-12-09 10:58:22,188 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:22,188 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:58:22,188 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:22,209 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-09 10:58:22,209 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:22,209 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2020-12-09 10:58:22,210 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:22,210 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-09 10:58:22,210 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:22,213 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:22,214 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:22,214 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:58:22,214 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:23,716 WARN L197 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 227 DAG size of output: 186 [2020-12-09 10:58:24,059 WARN L197 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2020-12-09 10:58:25,715 WARN L197 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 311 DAG size of output: 266 [2020-12-09 10:58:26,402 WARN L197 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2020-12-09 10:58:26,415 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:26,416 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:26,416 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:58:26,416 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:26,435 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:26,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:26,436 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 1] term [2020-12-09 10:58:26,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:27,176 WARN L197 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2020-12-09 10:58:27,545 WARN L197 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-12-09 10:58:28,234 WARN L197 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2020-12-09 10:58:28,863 WARN L197 SmtUtils]: Spent 627.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2020-12-09 10:58:28,892 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:28,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:28,892 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 1] term [2020-12-09 10:58:28,893 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:28,911 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:28,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:28,912 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:58:28,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:28,938 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:28,938 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:28,938 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:58:28,938 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:28,955 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 10:58:28,955 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:28,956 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 10:58:28,956 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:28,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:28,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:28,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 1] term [2020-12-09 10:58:28,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:28,993 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:28,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:28,994 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:58:28,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:29,012 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:29,012 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:29,012 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:58:29,012 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:29,038 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:29,038 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:29,039 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 1] term [2020-12-09 10:58:29,039 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:29,417 WARN L197 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2020-12-09 10:58:29,749 WARN L197 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2020-12-09 10:58:31,480 WARN L197 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 276 DAG size of output: 275 [2020-12-09 10:58:32,475 WARN L197 SmtUtils]: Spent 994.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2020-12-09 10:58:32,489 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-09 10:58:32,489 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:32,777 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:32,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:32,778 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:58:32,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:32,800 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 10:58:32,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:32,800 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 10:58:32,801 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:33,109 WARN L197 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2020-12-09 10:58:33,246 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-12-09 10:58:33,542 WARN L197 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2020-12-09 10:58:33,673 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-12-09 10:58:33,707 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:33,707 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:33,708 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 1] term [2020-12-09 10:58:33,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:33,724 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:33,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:33,725 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:58:33,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:33,747 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:58:33,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:33,747 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:58:33,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:58:33,770 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 10:58:33,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:33,771 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 10:58:33,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:58:33,783 INFO L131 LiptonReduction]: Checked pairs total: 2263 [2020-12-09 10:58:33,784 INFO L133 LiptonReduction]: Total number of compositions: 71 [2020-12-09 10:58:33,787 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-12-09 10:58:33,799 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 162 states. [2020-12-09 10:58:33,800 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2020-12-09 10:58:33,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 10:58:33,804 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:58:33,804 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 10:58:33,804 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:58:33,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:58:33,808 INFO L82 PathProgramCache]: Analyzing trace with hash 875792291, now seen corresponding path program 1 times [2020-12-09 10:58:33,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:58:33,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639631364] [2020-12-09 10:58:33,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:58:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:58:33,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:58:33,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639631364] [2020-12-09 10:58:33,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:58:33,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 10:58:33,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346757944] [2020-12-09 10:58:33,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 10:58:33,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:58:33,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 10:58:33,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 10:58:33,983 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2020-12-09 10:58:34,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:58:34,042 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-12-09 10:58:34,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 10:58:34,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 10:58:34,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:58:34,051 INFO L225 Difference]: With dead ends: 137 [2020-12-09 10:58:34,051 INFO L226 Difference]: Without dead ends: 112 [2020-12-09 10:58:34,052 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 10:58:34,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-12-09 10:58:34,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-12-09 10:58:34,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-12-09 10:58:34,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-12-09 10:58:34,081 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 5 [2020-12-09 10:58:34,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:58:34,081 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-12-09 10:58:34,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 10:58:34,082 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-12-09 10:58:34,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 10:58:34,082 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:58:34,082 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:58:34,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 10:58:34,082 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:58:34,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:58:34,083 INFO L82 PathProgramCache]: Analyzing trace with hash -177150300, now seen corresponding path program 1 times [2020-12-09 10:58:34,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:58:34,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085850263] [2020-12-09 10:58:34,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:58:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:58:34,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:58:34,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085850263] [2020-12-09 10:58:34,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:58:34,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 10:58:34,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606070589] [2020-12-09 10:58:34,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 10:58:34,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:58:34,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 10:58:34,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 10:58:34,165 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-12-09 10:58:34,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:58:34,174 INFO L93 Difference]: Finished difference Result 110 states and 249 transitions. [2020-12-09 10:58:34,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 10:58:34,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-09 10:58:34,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:58:34,176 INFO L225 Difference]: With dead ends: 110 [2020-12-09 10:58:34,176 INFO L226 Difference]: Without dead ends: 110 [2020-12-09 10:58:34,176 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 10:58:34,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-12-09 10:58:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-12-09 10:58:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-09 10:58:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 249 transitions. [2020-12-09 10:58:34,185 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 249 transitions. Word has length 7 [2020-12-09 10:58:34,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:58:34,185 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 249 transitions. [2020-12-09 10:58:34,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 10:58:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 249 transitions. [2020-12-09 10:58:34,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 10:58:34,186 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:58:34,186 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:58:34,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 10:58:34,186 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:58:34,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:58:34,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1669033564, now seen corresponding path program 1 times [2020-12-09 10:58:34,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:58:34,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419780366] [2020-12-09 10:58:34,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:58:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:58:34,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:58:34,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419780366] [2020-12-09 10:58:34,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:58:34,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:58:34,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767526397] [2020-12-09 10:58:34,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:58:34,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:58:34,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:58:34,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:58:34,307 INFO L87 Difference]: Start difference. First operand 110 states and 249 transitions. Second operand 5 states. [2020-12-09 10:58:34,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:58:34,364 INFO L93 Difference]: Finished difference Result 106 states and 238 transitions. [2020-12-09 10:58:34,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:58:34,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-12-09 10:58:34,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:58:34,366 INFO L225 Difference]: With dead ends: 106 [2020-12-09 10:58:34,366 INFO L226 Difference]: Without dead ends: 106 [2020-12-09 10:58:34,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:58:34,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-12-09 10:58:34,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-12-09 10:58:34,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-12-09 10:58:34,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 238 transitions. [2020-12-09 10:58:34,373 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 238 transitions. Word has length 8 [2020-12-09 10:58:34,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:58:34,373 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 238 transitions. [2020-12-09 10:58:34,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:58:34,373 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 238 transitions. [2020-12-09 10:58:34,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 10:58:34,374 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:58:34,374 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:58:34,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 10:58:34,374 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:58:34,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:58:34,375 INFO L82 PathProgramCache]: Analyzing trace with hash -200433289, now seen corresponding path program 1 times [2020-12-09 10:58:34,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:58:34,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581086202] [2020-12-09 10:58:34,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:58:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:58:34,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:58:34,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581086202] [2020-12-09 10:58:34,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:58:34,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:58:34,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255347093] [2020-12-09 10:58:34,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:58:34,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:58:34,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:58:34,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:58:34,464 INFO L87 Difference]: Start difference. First operand 106 states and 238 transitions. Second operand 5 states. [2020-12-09 10:58:34,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:58:34,512 INFO L93 Difference]: Finished difference Result 103 states and 229 transitions. [2020-12-09 10:58:34,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:58:34,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 10:58:34,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:58:34,514 INFO L225 Difference]: With dead ends: 103 [2020-12-09 10:58:34,514 INFO L226 Difference]: Without dead ends: 103 [2020-12-09 10:58:34,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:58:34,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-12-09 10:58:34,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-12-09 10:58:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-12-09 10:58:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 229 transitions. [2020-12-09 10:58:34,519 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 229 transitions. Word has length 9 [2020-12-09 10:58:34,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:58:34,520 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 229 transitions. [2020-12-09 10:58:34,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:58:34,520 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 229 transitions. [2020-12-09 10:58:34,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 10:58:34,520 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:58:34,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:58:34,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 10:58:34,521 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:58:34,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:58:34,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1876725577, now seen corresponding path program 1 times [2020-12-09 10:58:34,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:58:34,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152614874] [2020-12-09 10:58:34,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:58:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:58:34,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:58:34,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152614874] [2020-12-09 10:58:34,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:58:34,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 10:58:34,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280537406] [2020-12-09 10:58:34,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 10:58:34,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:58:34,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 10:58:34,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 10:58:34,654 INFO L87 Difference]: Start difference. First operand 103 states and 229 transitions. Second operand 7 states. [2020-12-09 10:58:34,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:58:34,759 INFO L93 Difference]: Finished difference Result 114 states and 251 transitions. [2020-12-09 10:58:34,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 10:58:34,760 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2020-12-09 10:58:34,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:58:34,762 INFO L225 Difference]: With dead ends: 114 [2020-12-09 10:58:34,762 INFO L226 Difference]: Without dead ends: 114 [2020-12-09 10:58:34,762 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-09 10:58:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-12-09 10:58:34,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2020-12-09 10:58:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-12-09 10:58:34,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 249 transitions. [2020-12-09 10:58:34,768 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 249 transitions. Word has length 10 [2020-12-09 10:58:34,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:58:34,768 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 249 transitions. [2020-12-09 10:58:34,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 10:58:34,768 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 249 transitions. [2020-12-09 10:58:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 10:58:34,769 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:58:34,769 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:58:34,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 10:58:34,769 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:58:34,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:58:34,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1029834262, now seen corresponding path program 1 times [2020-12-09 10:58:34,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:58:34,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573430579] [2020-12-09 10:58:34,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:58:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:58:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:58:34,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573430579] [2020-12-09 10:58:34,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:58:34,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 10:58:34,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593215167] [2020-12-09 10:58:34,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 10:58:34,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:58:34,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 10:58:34,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 10:58:34,807 INFO L87 Difference]: Start difference. First operand 113 states and 249 transitions. Second operand 3 states. [2020-12-09 10:58:34,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:58:34,824 INFO L93 Difference]: Finished difference Result 153 states and 326 transitions. [2020-12-09 10:58:34,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 10:58:34,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-12-09 10:58:34,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:58:34,826 INFO L225 Difference]: With dead ends: 153 [2020-12-09 10:58:34,826 INFO L226 Difference]: Without dead ends: 95 [2020-12-09 10:58:34,826 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 10:58:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-12-09 10:58:34,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2020-12-09 10:58:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-12-09 10:58:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 182 transitions. [2020-12-09 10:58:34,831 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 182 transitions. Word has length 10 [2020-12-09 10:58:34,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:58:34,832 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 182 transitions. [2020-12-09 10:58:34,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 10:58:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 182 transitions. [2020-12-09 10:58:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 10:58:34,833 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:58:34,833 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:58:34,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 10:58:34,833 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:58:34,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:58:34,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1951050792, now seen corresponding path program 1 times [2020-12-09 10:58:34,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:58:34,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170451504] [2020-12-09 10:58:34,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:58:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:58:35,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:58:35,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170451504] [2020-12-09 10:58:35,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:58:35,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 10:58:35,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008966037] [2020-12-09 10:58:35,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 10:58:35,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:58:35,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 10:58:35,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-09 10:58:35,006 INFO L87 Difference]: Start difference. First operand 89 states and 182 transitions. Second operand 8 states. [2020-12-09 10:58:35,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:58:35,131 INFO L93 Difference]: Finished difference Result 86 states and 173 transitions. [2020-12-09 10:58:35,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 10:58:35,132 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-12-09 10:58:35,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:58:35,133 INFO L225 Difference]: With dead ends: 86 [2020-12-09 10:58:35,133 INFO L226 Difference]: Without dead ends: 63 [2020-12-09 10:58:35,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-12-09 10:58:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-12-09 10:58:35,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-12-09 10:58:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-09 10:58:35,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 128 transitions. [2020-12-09 10:58:35,136 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 128 transitions. Word has length 11 [2020-12-09 10:58:35,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:58:35,136 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 128 transitions. [2020-12-09 10:58:35,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 10:58:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 128 transitions. [2020-12-09 10:58:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 10:58:35,137 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:58:35,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:58:35,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 10:58:35,137 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:58:35,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:58:35,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1860125320, now seen corresponding path program 1 times [2020-12-09 10:58:35,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:58:35,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71195739] [2020-12-09 10:58:35,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:58:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:58:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:58:35,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71195739] [2020-12-09 10:58:35,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:58:35,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:58:35,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126628498] [2020-12-09 10:58:35,196 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:58:35,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:58:35,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:58:35,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:58:35,197 INFO L87 Difference]: Start difference. First operand 63 states and 128 transitions. Second operand 4 states. [2020-12-09 10:58:35,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:58:35,241 INFO L93 Difference]: Finished difference Result 78 states and 149 transitions. [2020-12-09 10:58:35,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 10:58:35,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-09 10:58:35,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:58:35,243 INFO L225 Difference]: With dead ends: 78 [2020-12-09 10:58:35,243 INFO L226 Difference]: Without dead ends: 61 [2020-12-09 10:58:35,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:58:35,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-12-09 10:58:35,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-12-09 10:58:35,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-09 10:58:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 124 transitions. [2020-12-09 10:58:35,246 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 124 transitions. Word has length 11 [2020-12-09 10:58:35,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:58:35,246 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 124 transitions. [2020-12-09 10:58:35,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:58:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 124 transitions. [2020-12-09 10:58:35,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 10:58:35,247 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:58:35,247 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:58:35,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 10:58:35,247 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:58:35,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:58:35,248 INFO L82 PathProgramCache]: Analyzing trace with hash -631002796, now seen corresponding path program 2 times [2020-12-09 10:58:35,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:58:35,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738609950] [2020-12-09 10:58:35,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:58:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:58:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:58:35,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738609950] [2020-12-09 10:58:35,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:58:35,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:58:35,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494180595] [2020-12-09 10:58:35,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:58:35,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:58:35,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:58:35,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:58:35,307 INFO L87 Difference]: Start difference. First operand 61 states and 124 transitions. Second operand 4 states. [2020-12-09 10:58:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:58:35,332 INFO L93 Difference]: Finished difference Result 56 states and 95 transitions. [2020-12-09 10:58:35,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 10:58:35,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-09 10:58:35,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:58:35,333 INFO L225 Difference]: With dead ends: 56 [2020-12-09 10:58:35,333 INFO L226 Difference]: Without dead ends: 40 [2020-12-09 10:58:35,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:58:35,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-12-09 10:58:35,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-12-09 10:58:35,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-12-09 10:58:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 63 transitions. [2020-12-09 10:58:35,335 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 63 transitions. Word has length 11 [2020-12-09 10:58:35,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:58:35,335 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 63 transitions. [2020-12-09 10:58:35,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:58:35,335 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 63 transitions. [2020-12-09 10:58:35,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 10:58:35,336 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:58:35,336 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:58:35,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 10:58:35,336 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:58:35,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:58:35,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1520933456, now seen corresponding path program 1 times [2020-12-09 10:58:35,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:58:35,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696157672] [2020-12-09 10:58:35,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:58:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:58:35,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:58:35,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696157672] [2020-12-09 10:58:35,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:58:35,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 10:58:35,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110373050] [2020-12-09 10:58:35,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:58:35,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:58:35,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:58:35,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:58:35,388 INFO L87 Difference]: Start difference. First operand 40 states and 63 transitions. Second operand 5 states. [2020-12-09 10:58:35,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:58:35,427 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2020-12-09 10:58:35,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 10:58:35,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-12-09 10:58:35,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:58:35,428 INFO L225 Difference]: With dead ends: 31 [2020-12-09 10:58:35,428 INFO L226 Difference]: Without dead ends: 24 [2020-12-09 10:58:35,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 10:58:35,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-12-09 10:58:35,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-12-09 10:58:35,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-12-09 10:58:35,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-12-09 10:58:35,430 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 12 [2020-12-09 10:58:35,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:58:35,430 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-12-09 10:58:35,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:58:35,430 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-12-09 10:58:35,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 10:58:35,431 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:58:35,431 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:58:35,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 10:58:35,431 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:58:35,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:58:35,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1333200705, now seen corresponding path program 1 times [2020-12-09 10:58:35,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:58:35,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186328137] [2020-12-09 10:58:35,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:58:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 10:58:35,461 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 10:58:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 10:58:35,498 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 10:58:35,522 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 10:58:35,522 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 10:58:35,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 10:58:35,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 10:58:35 BasicIcfg [2020-12-09 10:58:35,565 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 10:58:35,565 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 10:58:35,565 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 10:58:35,565 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 10:58:35,566 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:58:14" (3/4) ... [2020-12-09 10:58:35,567 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 10:58:35,626 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_13574c16-6529-4cc9-8305-ab427415177f/bin/utaipan/witness.graphml [2020-12-09 10:58:35,626 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 10:58:35,627 INFO L168 Benchmark]: Toolchain (without parser) took 22666.61 ms. Allocated memory was 111.1 MB in the beginning and 247.5 MB in the end (delta: 136.3 MB). Free memory was 81.9 MB in the beginning and 209.7 MB in the end (delta: -127.8 MB). Peak memory consumption was 148.9 MB. Max. memory is 16.1 GB. [2020-12-09 10:58:35,627 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 67.1 MB. Free memory is still 39.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 10:58:35,627 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.82 ms. Allocated memory is still 111.1 MB. Free memory was 81.6 MB in the beginning and 65.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-12-09 10:58:35,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.00 ms. Allocated memory is still 111.1 MB. Free memory was 65.5 MB in the beginning and 62.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 10:58:35,628 INFO L168 Benchmark]: Boogie Preprocessor took 28.03 ms. Allocated memory is still 111.1 MB. Free memory was 62.9 MB in the beginning and 60.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 10:58:35,628 INFO L168 Benchmark]: RCFGBuilder took 1329.79 ms. Allocated memory was 111.1 MB in the beginning and 140.5 MB in the end (delta: 29.4 MB). Free memory was 60.8 MB in the beginning and 60.2 MB in the end (delta: 577.4 kB). Peak memory consumption was 55.0 MB. Max. memory is 16.1 GB. [2020-12-09 10:58:35,628 INFO L168 Benchmark]: TraceAbstraction took 20795.77 ms. Allocated memory was 140.5 MB in the beginning and 247.5 MB in the end (delta: 107.0 MB). Free memory was 59.2 MB in the beginning and 76.6 MB in the end (delta: -17.5 MB). Peak memory consumption was 88.5 MB. Max. memory is 16.1 GB. [2020-12-09 10:58:35,629 INFO L168 Benchmark]: Witness Printer took 61.33 ms. Allocated memory is still 247.5 MB. Free memory was 76.6 MB in the beginning and 209.7 MB in the end (delta: -133.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-09 10:58:35,630 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.14 ms. Allocated memory is still 67.1 MB. Free memory is still 39.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 395.82 ms. Allocated memory is still 111.1 MB. Free memory was 81.6 MB in the beginning and 65.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 51.00 ms. Allocated memory is still 111.1 MB. Free memory was 65.5 MB in the beginning and 62.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.03 ms. Allocated memory is still 111.1 MB. Free memory was 62.9 MB in the beginning and 60.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1329.79 ms. Allocated memory was 111.1 MB in the beginning and 140.5 MB in the end (delta: 29.4 MB). Free memory was 60.8 MB in the beginning and 60.2 MB in the end (delta: 577.4 kB). Peak memory consumption was 55.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20795.77 ms. Allocated memory was 140.5 MB in the beginning and 247.5 MB in the end (delta: 107.0 MB). Free memory was 59.2 MB in the beginning and 76.6 MB in the end (delta: -17.5 MB). Peak memory consumption was 88.5 MB. Max. memory is 16.1 GB. * Witness Printer took 61.33 ms. Allocated memory is still 247.5 MB. Free memory was 76.6 MB in the beginning and 209.7 MB in the end (delta: -133.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 571 VarBasedMoverChecksPositive, 54 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 37 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 60 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 18.9s, 84 PlacesBefore, 26 PlacesAfterwards, 79 TransitionsBefore, 19 TransitionsAfterwards, 918 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 71 TotalNumberOfCompositions, 2263 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2479; [L791] FCALL, FORK 0 pthread_create(&t2479, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t2480; [L793] FCALL, FORK 0 pthread_create(&t2480, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.6s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.9s, HoareTripleCheckerStatistics: 146 SDtfs, 121 SDslu, 176 SDs, 0 SdLazy, 214 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 5871 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...