./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe010_pso.oepc.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_aaa49012-f188-4177-8051-8284b7f8aa7c/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_aaa49012-f188-4177-8051-8284b7f8aa7c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_aaa49012-f188-4177-8051-8284b7f8aa7c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_aaa49012-f188-4177-8051-8284b7f8aa7c/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe010_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_aaa49012-f188-4177-8051-8284b7f8aa7c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_aaa49012-f188-4177-8051-8284b7f8aa7c/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 7e4700a6012d780ac278c365628766d67748f19b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 06:29:16,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 06:29:16,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 06:29:16,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 06:29:16,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 06:29:16,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 06:29:16,305 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 06:29:16,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 06:29:16,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 06:29:16,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 06:29:16,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 06:29:16,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 06:29:16,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 06:29:16,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 06:29:16,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 06:29:16,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 06:29:16,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 06:29:16,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 06:29:16,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 06:29:16,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 06:29:16,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 06:29:16,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 06:29:16,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 06:29:16,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 06:29:16,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 06:29:16,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 06:29:16,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 06:29:16,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 06:29:16,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 06:29:16,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 06:29:16,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 06:29:16,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 06:29:16,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 06:29:16,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 06:29:16,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 06:29:16,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 06:29:16,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 06:29:16,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 06:29:16,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 06:29:16,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 06:29:16,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 06:29:16,336 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_aaa49012-f188-4177-8051-8284b7f8aa7c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 06:29:16,354 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 06:29:16,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 06:29:16,354 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 06:29:16,355 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 06:29:16,355 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 06:29:16,355 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 06:29:16,355 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 06:29:16,355 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 06:29:16,355 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 06:29:16,355 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 06:29:16,355 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 06:29:16,356 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 06:29:16,356 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 06:29:16,356 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 06:29:16,356 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 06:29:16,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 06:29:16,356 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 06:29:16,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 06:29:16,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 06:29:16,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 06:29:16,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 06:29:16,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 06:29:16,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 06:29:16,357 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 06:29:16,357 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 06:29:16,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 06:29:16,358 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 06:29:16,358 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 06:29:16,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 06:29:16,358 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 06:29:16,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 06:29:16,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 06:29:16,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 06:29:16,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 06:29:16,358 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 06:29:16,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 06:29:16,359 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 06:29:16,359 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 06:29:16,359 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 06:29:16,359 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_aaa49012-f188-4177-8051-8284b7f8aa7c/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_aaa49012-f188-4177-8051-8284b7f8aa7c/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 -> 7e4700a6012d780ac278c365628766d67748f19b [2020-12-09 06:29:16,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 06:29:16,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 06:29:16,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 06:29:16,574 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 06:29:16,575 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 06:29:16,576 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_aaa49012-f188-4177-8051-8284b7f8aa7c/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe010_pso.oepc.i [2020-12-09 06:29:16,626 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aaa49012-f188-4177-8051-8284b7f8aa7c/bin/utaipan/data/8a44a78c4/4ee0ad8aca5d45caa542cb892e9491a6/FLAGfc510dcea [2020-12-09 06:29:17,032 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 06:29:17,033 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_aaa49012-f188-4177-8051-8284b7f8aa7c/sv-benchmarks/c/pthread-wmm/safe010_pso.oepc.i [2020-12-09 06:29:17,044 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aaa49012-f188-4177-8051-8284b7f8aa7c/bin/utaipan/data/8a44a78c4/4ee0ad8aca5d45caa542cb892e9491a6/FLAGfc510dcea [2020-12-09 06:29:17,054 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_aaa49012-f188-4177-8051-8284b7f8aa7c/bin/utaipan/data/8a44a78c4/4ee0ad8aca5d45caa542cb892e9491a6 [2020-12-09 06:29:17,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 06:29:17,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 06:29:17,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 06:29:17,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 06:29:17,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 06:29:17,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:29:17" (1/1) ... [2020-12-09 06:29:17,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bcdaed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:17, skipping insertion in model container [2020-12-09 06:29:17,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:29:17" (1/1) ... [2020-12-09 06:29:17,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 06:29:17,099 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 06:29:17,220 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_aaa49012-f188-4177-8051-8284b7f8aa7c/sv-benchmarks/c/pthread-wmm/safe010_pso.oepc.i[950,963] [2020-12-09 06:29:17,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:29:17,333 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 06:29:17,342 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_aaa49012-f188-4177-8051-8284b7f8aa7c/sv-benchmarks/c/pthread-wmm/safe010_pso.oepc.i[950,963] [2020-12-09 06:29:17,376 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:29:17,424 INFO L208 MainTranslator]: Completed translation [2020-12-09 06:29:17,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:17 WrapperNode [2020-12-09 06:29:17,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 06:29:17,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 06:29:17,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 06:29:17,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 06:29:17,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:17" (1/1) ... [2020-12-09 06:29:17,445 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:17" (1/1) ... [2020-12-09 06:29:17,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 06:29:17,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 06:29:17,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 06:29:17,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 06:29:17,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:17" (1/1) ... [2020-12-09 06:29:17,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:17" (1/1) ... [2020-12-09 06:29:17,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:17" (1/1) ... [2020-12-09 06:29:17,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:17" (1/1) ... [2020-12-09 06:29:17,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:17" (1/1) ... [2020-12-09 06:29:17,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:17" (1/1) ... [2020-12-09 06:29:17,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:17" (1/1) ... [2020-12-09 06:29:17,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 06:29:17,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 06:29:17,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 06:29:17,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 06:29:17,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aaa49012-f188-4177-8051-8284b7f8aa7c/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 06:29:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 06:29:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 06:29:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 06:29:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 06:29:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-09 06:29:17,565 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-09 06:29:17,565 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-09 06:29:17,565 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-09 06:29:17,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 06:29:17,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 06:29:17,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 06:29:17,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 06:29:17,566 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-09 06:29:18,776 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 06:29:18,777 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-09 06:29:18,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:29:18 BoogieIcfgContainer [2020-12-09 06:29:18,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 06:29:18,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 06:29:18,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 06:29:18,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 06:29:18,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:29:17" (1/3) ... [2020-12-09 06:29:18,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31caf76d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:29:18, skipping insertion in model container [2020-12-09 06:29:18,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:17" (2/3) ... [2020-12-09 06:29:18,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31caf76d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:29:18, skipping insertion in model container [2020-12-09 06:29:18,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:29:18" (3/3) ... [2020-12-09 06:29:18,786 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_pso.oepc.i [2020-12-09 06:29:18,799 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 06:29:18,799 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 06:29:18,803 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 06:29:18,803 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 06:29:18,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,832 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,833 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,833 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,833 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,833 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,834 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,834 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,835 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,838 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,839 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,839 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,839 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,839 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,846 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,846 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,846 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,848 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,849 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:29:18,851 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-09 06:29:18,859 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-12-09 06:29:18,875 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 06:29:18,875 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 06:29:18,875 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 06:29:18,876 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 06:29:18,876 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 06:29:18,876 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 06:29:18,876 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 06:29:18,876 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 06:29:18,885 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 06:29:18,886 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 80 transitions, 170 flow [2020-12-09 06:29:18,889 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 80 transitions, 170 flow [2020-12-09 06:29:18,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2020-12-09 06:29:18,923 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-12-09 06:29:18,923 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-09 06:29:18,926 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2020-12-09 06:29:18,928 INFO L116 LiptonReduction]: Number of co-enabled transitions 926 [2020-12-09 06:29:19,198 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-09 06:29:19,567 WARN L197 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-09 06:29:19,679 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-12-09 06:29:19,783 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 06:29:19,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:19,785 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 06:29:19,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:19,831 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 06:29:19,831 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:29:19,832 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:29:19,832 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:29:19,907 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:29:19,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:29:19,912 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 06:29:19,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:19,914 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:29:19,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:19,917 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 06:29:19,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:29:19,920 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 06:29:19,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:29:19,921 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 06:29:19,922 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:29:19,925 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 06:29:19,926 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:19,929 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 06:29:19,929 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:19,930 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 06:29:19,931 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:19,988 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 06:29:19,989 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:19,990 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 06:29:19,990 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:19,992 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 06:29:19,992 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 06:29:19,994 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 06:29:19,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:20,328 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 06:29:20,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:20,330 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 06:29:20,330 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:20,343 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-09 06:29:20,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:20,345 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 06:29:20,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:20,346 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-09 06:29:20,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:20,381 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 2, 1] term [2020-12-09 06:29:20,382 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:20,383 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 06:29:20,383 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:21,317 WARN L197 SmtUtils]: Spent 914.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-12-09 06:29:21,612 WARN L197 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2020-12-09 06:29:23,085 WARN L197 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2020-12-09 06:29:23,699 WARN L197 SmtUtils]: Spent 612.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2020-12-09 06:29:23,724 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 06:29:23,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:23,725 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 06:29:23,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:23,727 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 06:29:23,727 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 06:29:23,729 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 06:29:23,730 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:23,764 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:29:23,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:29:23,769 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 06:29:23,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:23,770 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:29:23,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:23,772 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 06:29:23,773 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:29:23,773 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 06:29:23,774 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:29:23,775 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 06:29:23,775 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:29:23,784 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 06:29:23,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:23,787 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 06:29:23,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:23,788 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 06:29:23,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:23,894 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:29:23,894 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:29:23,895 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 06:29:23,896 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:23,896 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:29:23,897 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:23,898 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 06:29:23,898 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:29:23,899 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 06:29:23,900 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:29:23,900 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 06:29:23,901 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:29:23,902 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 06:29:23,902 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:23,903 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 06:29:23,903 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:23,905 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 06:29:23,905 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:23,941 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 06:29:23,942 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:23,942 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 06:29:23,942 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:23,944 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 06:29:23,944 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 06:29:23,946 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 06:29:23,946 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:23,975 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 06:29:23,976 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:23,976 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 06:29:23,976 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:23,997 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 06:29:23,997 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:23,998 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 06:29:23,998 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:24,020 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 06:29:24,025 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:29:24,026 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:29:24,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:29:24,053 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 06:29:24,053 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:24,054 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 06:29:24,054 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:24,336 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 06:29:24,336 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:24,337 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 06:29:24,337 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:24,355 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 06:29:24,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:29:24,356 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:29:24,356 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:29:24,374 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 06:29:24,374 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:29:24,449 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 06:29:24,450 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:24,450 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 06:29:24,450 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:24,487 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 06:29:24,487 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:24,488 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 06:29:24,488 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:24,508 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 06:29:24,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:29:24,509 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:29:24,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:29:24,526 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 06:29:24,526 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:24,527 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 06:29:24,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:24,551 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-09 06:29:24,551 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:29:24,752 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 2, 1] term [2020-12-09 06:29:24,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:24,753 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 06:29:24,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:24,770 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 06:29:24,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:24,771 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 06:29:24,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:29:25,151 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 06:29:25,151 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:29:26,108 WARN L197 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2020-12-09 06:29:26,223 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-12-09 06:29:26,503 WARN L197 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2020-12-09 06:29:26,607 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-12-09 06:29:26,615 INFO L131 LiptonReduction]: Checked pairs total: 2423 [2020-12-09 06:29:26,616 INFO L133 LiptonReduction]: Total number of compositions: 73 [2020-12-09 06:29:26,619 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 21 transitions, 52 flow [2020-12-09 06:29:26,630 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 194 states. [2020-12-09 06:29:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states. [2020-12-09 06:29:26,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 06:29:26,634 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:29:26,635 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 06:29:26,635 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:29:26,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:29:26,638 INFO L82 PathProgramCache]: Analyzing trace with hash 914219, now seen corresponding path program 1 times [2020-12-09 06:29:26,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:29:26,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729544300] [2020-12-09 06:29:26,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:29:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:29:26,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:29:26,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729544300] [2020-12-09 06:29:26,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:29:26,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 06:29:26,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117099482] [2020-12-09 06:29:26,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 06:29:26,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:29:26,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 06:29:26,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 06:29:26,793 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 3 states. [2020-12-09 06:29:26,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:29:26,838 INFO L93 Difference]: Finished difference Result 162 states and 385 transitions. [2020-12-09 06:29:26,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 06:29:26,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-09 06:29:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:29:26,847 INFO L225 Difference]: With dead ends: 162 [2020-12-09 06:29:26,847 INFO L226 Difference]: Without dead ends: 137 [2020-12-09 06:29:26,848 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 06:29:26,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-12-09 06:29:26,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-12-09 06:29:26,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-12-09 06:29:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 320 transitions. [2020-12-09 06:29:26,879 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 320 transitions. Word has length 3 [2020-12-09 06:29:26,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:29:26,880 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 320 transitions. [2020-12-09 06:29:26,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 06:29:26,880 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 320 transitions. [2020-12-09 06:29:26,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 06:29:26,880 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:29:26,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:29:26,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 06:29:26,881 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:29:26,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:29:26,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1599981207, now seen corresponding path program 1 times [2020-12-09 06:29:26,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:29:26,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770408257] [2020-12-09 06:29:26,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:29:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:29:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:29:26,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770408257] [2020-12-09 06:29:26,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:29:26,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 06:29:26,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112385431] [2020-12-09 06:29:26,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:29:26,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:29:26,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:29:26,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:29:26,998 INFO L87 Difference]: Start difference. First operand 137 states and 320 transitions. Second operand 4 states. [2020-12-09 06:29:27,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:29:27,023 INFO L93 Difference]: Finished difference Result 152 states and 337 transitions. [2020-12-09 06:29:27,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:29:27,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-12-09 06:29:27,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:29:27,024 INFO L225 Difference]: With dead ends: 152 [2020-12-09 06:29:27,024 INFO L226 Difference]: Without dead ends: 127 [2020-12-09 06:29:27,025 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 06:29:27,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-12-09 06:29:27,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-12-09 06:29:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-12-09 06:29:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 292 transitions. [2020-12-09 06:29:27,034 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 292 transitions. Word has length 8 [2020-12-09 06:29:27,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:29:27,034 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 292 transitions. [2020-12-09 06:29:27,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:29:27,034 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 292 transitions. [2020-12-09 06:29:27,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 06:29:27,035 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:29:27,035 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:29:27,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 06:29:27,035 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:29:27,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:29:27,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1939606054, now seen corresponding path program 1 times [2020-12-09 06:29:27,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:29:27,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305890687] [2020-12-09 06:29:27,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:29:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:29:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:29:27,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305890687] [2020-12-09 06:29:27,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:29:27,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 06:29:27,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357493567] [2020-12-09 06:29:27,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:29:27,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:29:27,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:29:27,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:29:27,131 INFO L87 Difference]: Start difference. First operand 127 states and 292 transitions. Second operand 5 states. [2020-12-09 06:29:27,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:29:27,170 INFO L93 Difference]: Finished difference Result 167 states and 374 transitions. [2020-12-09 06:29:27,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:29:27,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 06:29:27,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:29:27,171 INFO L225 Difference]: With dead ends: 167 [2020-12-09 06:29:27,171 INFO L226 Difference]: Without dead ends: 87 [2020-12-09 06:29:27,171 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 06:29:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-12-09 06:29:27,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-12-09 06:29:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-12-09 06:29:27,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 184 transitions. [2020-12-09 06:29:27,177 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 184 transitions. Word has length 9 [2020-12-09 06:29:27,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:29:27,177 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 184 transitions. [2020-12-09 06:29:27,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:29:27,177 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 184 transitions. [2020-12-09 06:29:27,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 06:29:27,178 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:29:27,178 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:29:27,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 06:29:27,178 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:29:27,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:29:27,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1839059167, now seen corresponding path program 1 times [2020-12-09 06:29:27,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:29:27,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144479397] [2020-12-09 06:29:27,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:29:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:29:27,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:29:27,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144479397] [2020-12-09 06:29:27,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:29:27,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:29:27,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834594953] [2020-12-09 06:29:27,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:29:27,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:29:27,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:29:27,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:29:27,306 INFO L87 Difference]: Start difference. First operand 87 states and 184 transitions. Second operand 6 states. [2020-12-09 06:29:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:29:27,387 INFO L93 Difference]: Finished difference Result 103 states and 210 transitions. [2020-12-09 06:29:27,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:29:27,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-12-09 06:29:27,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:29:27,389 INFO L225 Difference]: With dead ends: 103 [2020-12-09 06:29:27,389 INFO L226 Difference]: Without dead ends: 91 [2020-12-09 06:29:27,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:29:27,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-12-09 06:29:27,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-12-09 06:29:27,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-12-09 06:29:27,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 191 transitions. [2020-12-09 06:29:27,397 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 191 transitions. Word has length 11 [2020-12-09 06:29:27,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:29:27,397 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 191 transitions. [2020-12-09 06:29:27,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:29:27,397 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 191 transitions. [2020-12-09 06:29:27,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 06:29:27,398 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:29:27,398 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:29:27,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 06:29:27,398 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:29:27,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:29:27,399 INFO L82 PathProgramCache]: Analyzing trace with hash -514648257, now seen corresponding path program 2 times [2020-12-09 06:29:27,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:29:27,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645615768] [2020-12-09 06:29:27,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:29:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:29:27,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:29:27,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645615768] [2020-12-09 06:29:27,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:29:27,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:29:27,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495734385] [2020-12-09 06:29:27,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:29:27,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:29:27,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:29:27,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:29:27,504 INFO L87 Difference]: Start difference. First operand 91 states and 191 transitions. Second operand 6 states. [2020-12-09 06:29:27,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:29:27,564 INFO L93 Difference]: Finished difference Result 101 states and 203 transitions. [2020-12-09 06:29:27,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:29:27,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-12-09 06:29:27,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:29:27,566 INFO L225 Difference]: With dead ends: 101 [2020-12-09 06:29:27,566 INFO L226 Difference]: Without dead ends: 89 [2020-12-09 06:29:27,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:29:27,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-12-09 06:29:27,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-12-09 06:29:27,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-12-09 06:29:27,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 185 transitions. [2020-12-09 06:29:27,572 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 185 transitions. Word has length 11 [2020-12-09 06:29:27,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:29:27,572 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 185 transitions. [2020-12-09 06:29:27,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:29:27,572 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 185 transitions. [2020-12-09 06:29:27,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 06:29:27,573 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:29:27,573 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:29:27,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 06:29:27,574 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:29:27,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:29:27,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1175562397, now seen corresponding path program 1 times [2020-12-09 06:29:27,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:29:27,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210840796] [2020-12-09 06:29:27,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:29:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:29:27,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:29:27,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210840796] [2020-12-09 06:29:27,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:29:27,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 06:29:27,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438638507] [2020-12-09 06:29:27,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:29:27,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:29:27,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:29:27,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:29:27,640 INFO L87 Difference]: Start difference. First operand 89 states and 185 transitions. Second operand 4 states. [2020-12-09 06:29:27,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:29:27,663 INFO L93 Difference]: Finished difference Result 72 states and 126 transitions. [2020-12-09 06:29:27,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:29:27,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-09 06:29:27,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:29:27,664 INFO L225 Difference]: With dead ends: 72 [2020-12-09 06:29:27,664 INFO L226 Difference]: Without dead ends: 55 [2020-12-09 06:29:27,665 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:29:27,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-12-09 06:29:27,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-12-09 06:29:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-12-09 06:29:27,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 92 transitions. [2020-12-09 06:29:27,668 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 92 transitions. Word has length 12 [2020-12-09 06:29:27,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:29:27,668 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 92 transitions. [2020-12-09 06:29:27,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:29:27,668 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 92 transitions. [2020-12-09 06:29:27,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 06:29:27,669 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:29:27,669 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:29:27,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 06:29:27,669 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:29:27,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:29:27,670 INFO L82 PathProgramCache]: Analyzing trace with hash -554044553, now seen corresponding path program 1 times [2020-12-09 06:29:27,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:29:27,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575811302] [2020-12-09 06:29:27,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:29:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:29:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:29:27,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575811302] [2020-12-09 06:29:27,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:29:27,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:29:27,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588041259] [2020-12-09 06:29:27,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:29:27,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:29:27,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:29:27,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:29:27,737 INFO L87 Difference]: Start difference. First operand 55 states and 92 transitions. Second operand 5 states. [2020-12-09 06:29:27,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:29:27,764 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. [2020-12-09 06:29:27,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:29:27,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-09 06:29:27,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:29:27,765 INFO L225 Difference]: With dead ends: 40 [2020-12-09 06:29:27,765 INFO L226 Difference]: Without dead ends: 33 [2020-12-09 06:29:27,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:29:27,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-12-09 06:29:27,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-12-09 06:29:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-12-09 06:29:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2020-12-09 06:29:27,768 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 13 [2020-12-09 06:29:27,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:29:27,768 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 48 transitions. [2020-12-09 06:29:27,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:29:27,768 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 48 transitions. [2020-12-09 06:29:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 06:29:27,769 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:29:27,769 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:29:27,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 06:29:27,769 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:29:27,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:29:27,770 INFO L82 PathProgramCache]: Analyzing trace with hash -647783936, now seen corresponding path program 1 times [2020-12-09 06:29:27,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:29:27,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031215197] [2020-12-09 06:29:27,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:29:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:29:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:29:27,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031215197] [2020-12-09 06:29:27,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:29:27,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 06:29:27,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155614404] [2020-12-09 06:29:27,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 06:29:27,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:29:27,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 06:29:27,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-09 06:29:27,974 INFO L87 Difference]: Start difference. First operand 33 states and 48 transitions. Second operand 8 states. [2020-12-09 06:29:28,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:29:28,088 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2020-12-09 06:29:28,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:29:28,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-12-09 06:29:28,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:29:28,089 INFO L225 Difference]: With dead ends: 42 [2020-12-09 06:29:28,089 INFO L226 Difference]: Without dead ends: 25 [2020-12-09 06:29:28,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-12-09 06:29:28,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-12-09 06:29:28,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-12-09 06:29:28,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-12-09 06:29:28,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-12-09 06:29:28,091 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2020-12-09 06:29:28,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:29:28,091 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-12-09 06:29:28,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 06:29:28,091 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2020-12-09 06:29:28,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 06:29:28,091 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:29:28,091 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:29:28,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 06:29:28,092 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:29:28,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:29:28,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1457285376, now seen corresponding path program 2 times [2020-12-09 06:29:28,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:29:28,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453354214] [2020-12-09 06:29:28,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:29:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 06:29:28,120 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 06:29:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 06:29:28,148 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 06:29:28,170 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 06:29:28,170 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 06:29:28,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 06:29:28,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:29:28 BasicIcfg [2020-12-09 06:29:28,211 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 06:29:28,211 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 06:29:28,211 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 06:29:28,211 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 06:29:28,211 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:29:18" (3/4) ... [2020-12-09 06:29:28,213 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 06:29:28,268 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_aaa49012-f188-4177-8051-8284b7f8aa7c/bin/utaipan/witness.graphml [2020-12-09 06:29:28,268 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 06:29:28,269 INFO L168 Benchmark]: Toolchain (without parser) took 11211.98 ms. Allocated memory was 115.3 MB in the beginning and 243.3 MB in the end (delta: 127.9 MB). Free memory was 82.6 MB in the beginning and 159.1 MB in the end (delta: -76.5 MB). Peak memory consumption was 52.1 MB. Max. memory is 16.1 GB. [2020-12-09 06:29:28,269 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 67.1 MB. Free memory is still 32.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 06:29:28,269 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.06 ms. Allocated memory is still 115.3 MB. Free memory was 82.3 MB in the beginning and 68.6 MB in the end (delta: 13.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-09 06:29:28,270 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.95 ms. Allocated memory is still 115.3 MB. Free memory was 68.6 MB in the beginning and 65.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 06:29:28,270 INFO L168 Benchmark]: Boogie Preprocessor took 35.33 ms. Allocated memory is still 115.3 MB. Free memory was 65.9 MB in the beginning and 63.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 06:29:28,270 INFO L168 Benchmark]: RCFGBuilder took 1273.44 ms. Allocated memory was 115.3 MB in the beginning and 138.4 MB in the end (delta: 23.1 MB). Free memory was 63.9 MB in the beginning and 65.8 MB in the end (delta: -2.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 16.1 GB. [2020-12-09 06:29:28,270 INFO L168 Benchmark]: TraceAbstraction took 9431.07 ms. Allocated memory was 138.4 MB in the beginning and 243.3 MB in the end (delta: 104.9 MB). Free memory was 65.8 MB in the beginning and 167.5 MB in the end (delta: -101.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 06:29:28,271 INFO L168 Benchmark]: Witness Printer took 57.21 ms. Allocated memory is still 243.3 MB. Free memory was 167.5 MB in the beginning and 159.1 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-09 06:29:28,272 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.15 ms. Allocated memory is still 67.1 MB. Free memory is still 32.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 367.06 ms. Allocated memory is still 115.3 MB. Free memory was 82.3 MB in the beginning and 68.6 MB in the end (delta: 13.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 42.95 ms. Allocated memory is still 115.3 MB. Free memory was 68.6 MB in the beginning and 65.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 35.33 ms. Allocated memory is still 115.3 MB. Free memory was 65.9 MB in the beginning and 63.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1273.44 ms. Allocated memory was 115.3 MB in the beginning and 138.4 MB in the end (delta: 23.1 MB). Free memory was 63.9 MB in the beginning and 65.8 MB in the end (delta: -2.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9431.07 ms. Allocated memory was 138.4 MB in the beginning and 243.3 MB in the end (delta: 104.9 MB). Free memory was 65.8 MB in the beginning and 167.5 MB in the end (delta: -101.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Witness Printer took 57.21 ms. Allocated memory is still 243.3 MB. Free memory was 167.5 MB in the beginning and 159.1 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 577 VarBasedMoverChecksPositive, 42 VarBasedMoverChecksNegative, 12 SemBasedMoverChecksPositive, 30 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 61 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.7s, 85 PlacesBefore, 27 PlacesAfterwards, 80 TransitionsBefore, 21 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 73 TotalNumberOfCompositions, 2423 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2013; [L793] FCALL, FORK 0 pthread_create(&t2013, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] 0 pthread_t t2014; [L795] FCALL, FORK 0 pthread_create(&t2014, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.2s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 138 SDtfs, 139 SDslu, 261 SDs, 0 SdLazy, 178 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 9245 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...