./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix057_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d8afd670-0810-4e0b-9bfe-9d03891fc3c4/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_d8afd670-0810-4e0b-9bfe-9d03891fc3c4/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d8afd670-0810-4e0b-9bfe-9d03891fc3c4/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d8afd670-0810-4e0b-9bfe-9d03891fc3c4/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix057_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d8afd670-0810-4e0b-9bfe-9d03891fc3c4/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d8afd670-0810-4e0b-9bfe-9d03891fc3c4/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 6df937937075082959735d2992fd1cc04193c7fa ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-22 12:48:57,249 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-22 12:48:57,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-22 12:48:57,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-22 12:48:57,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-22 12:48:57,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-22 12:48:57,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-22 12:48:57,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-22 12:48:57,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-22 12:48:57,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-22 12:48:57,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-22 12:48:57,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-22 12:48:57,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-22 12:48:57,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-22 12:48:57,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-22 12:48:57,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-22 12:48:57,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-22 12:48:57,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-22 12:48:57,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-22 12:48:57,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-22 12:48:57,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-22 12:48:57,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-22 12:48:57,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-22 12:48:57,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-22 12:48:57,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-22 12:48:57,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-22 12:48:57,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-22 12:48:57,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-22 12:48:57,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-22 12:48:57,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-22 12:48:57,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-22 12:48:57,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-22 12:48:57,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-22 12:48:57,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-22 12:48:57,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-22 12:48:57,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-22 12:48:57,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-22 12:48:57,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-22 12:48:57,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-22 12:48:57,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-22 12:48:57,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-22 12:48:57,422 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d8afd670-0810-4e0b-9bfe-9d03891fc3c4/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-22 12:48:57,447 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-22 12:48:57,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-22 12:48:57,448 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-22 12:48:57,449 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-22 12:48:57,449 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-22 12:48:57,449 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-22 12:48:57,449 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-22 12:48:57,450 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-22 12:48:57,450 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-22 12:48:57,450 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-22 12:48:57,450 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-22 12:48:57,451 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-22 12:48:57,451 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-22 12:48:57,451 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-22 12:48:57,451 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-22 12:48:57,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-22 12:48:57,452 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-22 12:48:57,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-22 12:48:57,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-22 12:48:57,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-22 12:48:57,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-22 12:48:57,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-22 12:48:57,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-22 12:48:57,454 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-22 12:48:57,454 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-22 12:48:57,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-22 12:48:57,455 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-22 12:48:57,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-22 12:48:57,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-22 12:48:57,456 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-22 12:48:57,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-22 12:48:57,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-22 12:48:57,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-22 12:48:57,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-22 12:48:57,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-22 12:48:57,457 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-22 12:48:57,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-22 12:48:57,458 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-22 12:48:57,458 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-22 12:48:57,458 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-22 12:48:57,459 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_d8afd670-0810-4e0b-9bfe-9d03891fc3c4/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_d8afd670-0810-4e0b-9bfe-9d03891fc3c4/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 -> 6df937937075082959735d2992fd1cc04193c7fa [2020-11-22 12:48:57,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-22 12:48:57,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-22 12:48:57,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-22 12:48:57,715 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-22 12:48:57,716 INFO L275 PluginConnector]: CDTParser initialized [2020-11-22 12:48:57,717 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d8afd670-0810-4e0b-9bfe-9d03891fc3c4/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix057_tso.oepc.i [2020-11-22 12:48:57,798 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d8afd670-0810-4e0b-9bfe-9d03891fc3c4/bin/utaipan/data/311586a92/3c4d7cfc1a6b44f0ac7b13ef9a72f4e4/FLAG825714b0a [2020-11-22 12:48:58,495 INFO L306 CDTParser]: Found 1 translation units. [2020-11-22 12:48:58,496 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d8afd670-0810-4e0b-9bfe-9d03891fc3c4/sv-benchmarks/c/pthread-wmm/mix057_tso.oepc.i [2020-11-22 12:48:58,513 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d8afd670-0810-4e0b-9bfe-9d03891fc3c4/bin/utaipan/data/311586a92/3c4d7cfc1a6b44f0ac7b13ef9a72f4e4/FLAG825714b0a [2020-11-22 12:48:58,786 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d8afd670-0810-4e0b-9bfe-9d03891fc3c4/bin/utaipan/data/311586a92/3c4d7cfc1a6b44f0ac7b13ef9a72f4e4 [2020-11-22 12:48:58,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-22 12:48:58,791 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-22 12:48:58,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-22 12:48:58,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-22 12:48:58,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-22 12:48:58,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:48:58" (1/1) ... [2020-11-22 12:48:58,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39481659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:58, skipping insertion in model container [2020-11-22 12:48:58,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:48:58" (1/1) ... [2020-11-22 12:48:58,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-22 12:48:58,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-22 12:48:59,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-22 12:48:59,342 INFO L203 MainTranslator]: Completed pre-run [2020-11-22 12:48:59,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-22 12:48:59,535 INFO L208 MainTranslator]: Completed translation [2020-11-22 12:48:59,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:59 WrapperNode [2020-11-22 12:48:59,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-22 12:48:59,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-22 12:48:59,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-22 12:48:59,538 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-22 12:48:59,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:59" (1/1) ... [2020-11-22 12:48:59,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:59" (1/1) ... [2020-11-22 12:48:59,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-22 12:48:59,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-22 12:48:59,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-22 12:48:59,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-22 12:48:59,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:59" (1/1) ... [2020-11-22 12:48:59,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:59" (1/1) ... [2020-11-22 12:48:59,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:59" (1/1) ... [2020-11-22 12:48:59,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:59" (1/1) ... [2020-11-22 12:48:59,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:59" (1/1) ... [2020-11-22 12:48:59,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:59" (1/1) ... [2020-11-22 12:48:59,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:59" (1/1) ... [2020-11-22 12:48:59,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-22 12:48:59,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-22 12:48:59,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-22 12:48:59,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-22 12:48:59,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d8afd670-0810-4e0b-9bfe-9d03891fc3c4/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-22 12:48:59,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-22 12:48:59,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-22 12:48:59,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-22 12:48:59,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-22 12:48:59,828 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-22 12:48:59,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-22 12:48:59,829 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-22 12:48:59,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-22 12:48:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-22 12:48:59,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-22 12:48:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-22 12:48:59,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-22 12:48:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-22 12:48:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-22 12:48:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-22 12:48:59,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-22 12:48:59,835 WARN L208 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-22 12:49:02,574 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-22 12:49:02,574 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-22 12:49:02,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:49:02 BoogieIcfgContainer [2020-11-22 12:49:02,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-22 12:49:02,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-22 12:49:02,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-22 12:49:02,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-22 12:49:02,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:48:58" (1/3) ... [2020-11-22 12:49:02,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6634d7f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:49:02, skipping insertion in model container [2020-11-22 12:49:02,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:59" (2/3) ... [2020-11-22 12:49:02,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6634d7f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:49:02, skipping insertion in model container [2020-11-22 12:49:02,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:49:02" (3/3) ... [2020-11-22 12:49:02,585 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_tso.oepc.i [2020-11-22 12:49:02,595 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-22 12:49:02,596 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-22 12:49:02,600 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-22 12:49:02,601 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-22 12:49:02,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,653 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,653 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,655 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,655 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,657 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,657 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,661 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,662 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,662 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,662 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,663 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,663 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,663 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,663 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,663 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,663 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,663 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,664 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,664 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,664 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,664 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,664 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,665 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,665 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,665 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,666 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,666 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,668 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,669 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,670 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,673 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,673 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,678 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,679 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,681 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,681 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:49:02,685 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-22 12:49:02,696 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-22 12:49:02,728 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-22 12:49:02,728 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-22 12:49:02,728 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-22 12:49:02,729 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-22 12:49:02,729 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-22 12:49:02,730 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-22 12:49:02,730 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-22 12:49:02,730 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-22 12:49:02,746 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-22 12:49:02,750 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 116 transitions, 252 flow [2020-11-22 12:49:02,759 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 116 transitions, 252 flow [2020-11-22 12:49:02,760 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 126 places, 116 transitions, 252 flow [2020-11-22 12:49:02,828 INFO L129 PetriNetUnfolder]: 3/112 cut-off events. [2020-11-22 12:49:02,828 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-22 12:49:02,833 INFO L80 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 3/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-11-22 12:49:02,839 INFO L116 LiptonReduction]: Number of co-enabled transitions 2622 [2020-11-22 12:49:02,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 12:49:02,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:49:03,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 12:49:03,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:49:03,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:49:03,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:03,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:49:03,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:03,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:49:03,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:03,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:49:03,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:03,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 12:49:03,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:49:04,156 WARN L193 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-22 12:49:04,308 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-22 12:49:04,558 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-22 12:49:04,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:49:04,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:04,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:49:04,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:04,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:49:04,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:04,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:49:04,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:04,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:49:04,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:49:04,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:49:04,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:49:04,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:49:04,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:49:04,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:49:04,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:49:04,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:49:04,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:49:04,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:49:04,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:49:04,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:49:04,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:49:04,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:49:04,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:49:05,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:49:05,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:49:05,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:49:05,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:49:05,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:49:05,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:49:05,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:49:05,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:49:05,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:49:05,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:49:05,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:49:05,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:49:05,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:49:05,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:49:05,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:49:05,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:49:05,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:49:05,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:05,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:49:05,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:05,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:49:05,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:05,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:49:05,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:05,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:49:05,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:05,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:49:05,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:05,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:49:05,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:05,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:49:05,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:05,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:49:05,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:05,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:49:05,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:05,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:49:05,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:05,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:49:05,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:05,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 12:49:05,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:49:05,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:49:05,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:05,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:49:05,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:05,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:49:05,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:05,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:49:05,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:07,613 WARN L193 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-11-22 12:49:07,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-22 12:49:07,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:07,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:49:07,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:49:09,217 WARN L193 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2020-11-22 12:49:09,913 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-11-22 12:49:10,375 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-22 12:49:10,812 WARN L193 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-11-22 12:49:10,982 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-22 12:49:11,008 INFO L131 LiptonReduction]: Checked pairs total: 6442 [2020-11-22 12:49:11,009 INFO L133 LiptonReduction]: Total number of compositions: 98 [2020-11-22 12:49:11,013 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-11-22 12:49:11,272 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3082 states. [2020-11-22 12:49:11,274 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states. [2020-11-22 12:49:11,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-22 12:49:11,283 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:49:11,284 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:49:11,285 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:49:11,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:49:11,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1604801105, now seen corresponding path program 1 times [2020-11-22 12:49:11,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:49:11,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573744551] [2020-11-22 12:49:11,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:49:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:49:11,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:49:11,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573744551] [2020-11-22 12:49:11,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:49:11,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-22 12:49:11,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299132368] [2020-11-22 12:49:11,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 12:49:11,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:49:11,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 12:49:11,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 12:49:11,695 INFO L87 Difference]: Start difference. First operand 3082 states. Second operand 3 states. [2020-11-22 12:49:11,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:49:11,880 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-11-22 12:49:11,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 12:49:11,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-22 12:49:11,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:49:11,948 INFO L225 Difference]: With dead ends: 2602 [2020-11-22 12:49:11,949 INFO L226 Difference]: Without dead ends: 2202 [2020-11-22 12:49:11,950 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 12:49:11,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2020-11-22 12:49:12,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2202. [2020-11-22 12:49:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-11-22 12:49:12,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 8424 transitions. [2020-11-22 12:49:12,174 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 8424 transitions. Word has length 9 [2020-11-22 12:49:12,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:49:12,175 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 8424 transitions. [2020-11-22 12:49:12,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 12:49:12,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 8424 transitions. [2020-11-22 12:49:12,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-22 12:49:12,187 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:49:12,188 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:49:12,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-22 12:49:12,188 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:49:12,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:49:12,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1351042416, now seen corresponding path program 1 times [2020-11-22 12:49:12,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:49:12,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002806350] [2020-11-22 12:49:12,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:49:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:49:12,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:49:12,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002806350] [2020-11-22 12:49:12,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:49:12,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:49:12,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436299765] [2020-11-22 12:49:12,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 12:49:12,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:49:12,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 12:49:12,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:49:12,454 INFO L87 Difference]: Start difference. First operand 2202 states and 8424 transitions. Second operand 5 states. [2020-11-22 12:49:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:49:12,674 INFO L93 Difference]: Finished difference Result 2582 states and 9578 transitions. [2020-11-22 12:49:12,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:49:12,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-22 12:49:12,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:49:12,699 INFO L225 Difference]: With dead ends: 2582 [2020-11-22 12:49:12,699 INFO L226 Difference]: Without dead ends: 2182 [2020-11-22 12:49:12,700 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:49:12,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2020-11-22 12:49:12,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2182. [2020-11-22 12:49:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2182 states. [2020-11-22 12:49:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 8328 transitions. [2020-11-22 12:49:12,840 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 8328 transitions. Word has length 12 [2020-11-22 12:49:12,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:49:12,841 INFO L481 AbstractCegarLoop]: Abstraction has 2182 states and 8328 transitions. [2020-11-22 12:49:12,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 12:49:12,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 8328 transitions. [2020-11-22 12:49:12,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-22 12:49:12,844 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:49:12,844 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:49:12,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-22 12:49:12,845 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:49:12,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:49:12,856 INFO L82 PathProgramCache]: Analyzing trace with hash -156942098, now seen corresponding path program 1 times [2020-11-22 12:49:12,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:49:12,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661157404] [2020-11-22 12:49:12,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:49:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:49:12,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:49:12,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661157404] [2020-11-22 12:49:12,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:49:12,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-22 12:49:12,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505918729] [2020-11-22 12:49:12,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 12:49:13,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:49:13,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 12:49:13,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 12:49:13,001 INFO L87 Difference]: Start difference. First operand 2182 states and 8328 transitions. Second operand 4 states. [2020-11-22 12:49:13,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:49:13,106 INFO L93 Difference]: Finished difference Result 2520 states and 9338 transitions. [2020-11-22 12:49:13,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:49:13,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-22 12:49:13,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:49:13,132 INFO L225 Difference]: With dead ends: 2520 [2020-11-22 12:49:13,132 INFO L226 Difference]: Without dead ends: 2170 [2020-11-22 12:49:13,132 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-11-22 12:49:13,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2020-11-22 12:49:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2170. [2020-11-22 12:49:13,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2020-11-22 12:49:13,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 8272 transitions. [2020-11-22 12:49:13,227 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 8272 transitions. Word has length 13 [2020-11-22 12:49:13,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:49:13,227 INFO L481 AbstractCegarLoop]: Abstraction has 2170 states and 8272 transitions. [2020-11-22 12:49:13,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 12:49:13,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 8272 transitions. [2020-11-22 12:49:13,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-22 12:49:13,230 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:49:13,230 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:49:13,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-22 12:49:13,231 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:49:13,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:49:13,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1067393042, now seen corresponding path program 1 times [2020-11-22 12:49:13,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:49:13,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610917578] [2020-11-22 12:49:13,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:49:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:49:13,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:49:13,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610917578] [2020-11-22 12:49:13,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:49:13,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:49:13,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129254033] [2020-11-22 12:49:13,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 12:49:13,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:49:13,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 12:49:13,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:49:13,367 INFO L87 Difference]: Start difference. First operand 2170 states and 8272 transitions. Second operand 5 states. [2020-11-22 12:49:13,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:49:13,554 INFO L93 Difference]: Finished difference Result 2410 states and 8924 transitions. [2020-11-22 12:49:13,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:49:13,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-22 12:49:13,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:49:13,577 INFO L225 Difference]: With dead ends: 2410 [2020-11-22 12:49:13,577 INFO L226 Difference]: Without dead ends: 2090 [2020-11-22 12:49:13,577 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-11-22 12:49:13,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2020-11-22 12:49:13,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2090. [2020-11-22 12:49:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2020-11-22 12:49:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7908 transitions. [2020-11-22 12:49:13,664 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7908 transitions. Word has length 13 [2020-11-22 12:49:13,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:49:13,664 INFO L481 AbstractCegarLoop]: Abstraction has 2090 states and 7908 transitions. [2020-11-22 12:49:13,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 12:49:13,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7908 transitions. [2020-11-22 12:49:13,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-22 12:49:13,667 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:49:13,668 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:49:13,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-22 12:49:13,668 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:49:13,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:49:13,668 INFO L82 PathProgramCache]: Analyzing trace with hash 984029452, now seen corresponding path program 1 times [2020-11-22 12:49:13,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:49:13,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283573518] [2020-11-22 12:49:13,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:49:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:49:13,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:49:13,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283573518] [2020-11-22 12:49:13,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:49:13,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:49:13,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039920857] [2020-11-22 12:49:13,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 12:49:13,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:49:13,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 12:49:13,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 12:49:13,775 INFO L87 Difference]: Start difference. First operand 2090 states and 7908 transitions. Second operand 4 states. [2020-11-22 12:49:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:49:13,835 INFO L93 Difference]: Finished difference Result 3298 states and 11938 transitions. [2020-11-22 12:49:13,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:49:13,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-22 12:49:13,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:49:13,861 INFO L225 Difference]: With dead ends: 3298 [2020-11-22 12:49:13,862 INFO L226 Difference]: Without dead ends: 2394 [2020-11-22 12:49:13,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:49:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2020-11-22 12:49:13,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2074. [2020-11-22 12:49:13,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2020-11-22 12:49:13,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 7536 transitions. [2020-11-22 12:49:13,950 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 7536 transitions. Word has length 14 [2020-11-22 12:49:13,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:49:13,950 INFO L481 AbstractCegarLoop]: Abstraction has 2074 states and 7536 transitions. [2020-11-22 12:49:13,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 12:49:13,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 7536 transitions. [2020-11-22 12:49:13,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-22 12:49:13,953 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:49:13,953 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:49:13,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-22 12:49:13,953 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:49:13,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:49:13,954 INFO L82 PathProgramCache]: Analyzing trace with hash -570272720, now seen corresponding path program 1 times [2020-11-22 12:49:13,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:49:13,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868782781] [2020-11-22 12:49:13,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:49:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:49:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:49:14,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868782781] [2020-11-22 12:49:14,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:49:14,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:49:14,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517929620] [2020-11-22 12:49:14,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 12:49:14,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:49:14,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 12:49:14,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:49:14,084 INFO L87 Difference]: Start difference. First operand 2074 states and 7536 transitions. Second operand 5 states. [2020-11-22 12:49:14,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:49:14,182 INFO L93 Difference]: Finished difference Result 2242 states and 7958 transitions. [2020-11-22 12:49:14,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:49:14,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-22 12:49:14,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:49:14,203 INFO L225 Difference]: With dead ends: 2242 [2020-11-22 12:49:14,203 INFO L226 Difference]: Without dead ends: 1962 [2020-11-22 12:49:14,203 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:49:14,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2020-11-22 12:49:14,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2020-11-22 12:49:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2020-11-22 12:49:14,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 7100 transitions. [2020-11-22 12:49:14,312 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 7100 transitions. Word has length 14 [2020-11-22 12:49:14,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:49:14,313 INFO L481 AbstractCegarLoop]: Abstraction has 1962 states and 7100 transitions. [2020-11-22 12:49:14,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 12:49:14,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 7100 transitions. [2020-11-22 12:49:14,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-22 12:49:14,316 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:49:14,316 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:49:14,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-22 12:49:14,317 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:49:14,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:49:14,317 INFO L82 PathProgramCache]: Analyzing trace with hash -570278486, now seen corresponding path program 1 times [2020-11-22 12:49:14,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:49:14,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277046701] [2020-11-22 12:49:14,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:49:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:49:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:49:14,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277046701] [2020-11-22 12:49:14,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:49:14,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:49:14,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854461760] [2020-11-22 12:49:14,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 12:49:14,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:49:14,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 12:49:14,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:49:14,453 INFO L87 Difference]: Start difference. First operand 1962 states and 7100 transitions. Second operand 5 states. [2020-11-22 12:49:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:49:14,557 INFO L93 Difference]: Finished difference Result 2214 states and 7824 transitions. [2020-11-22 12:49:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:49:14,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-22 12:49:14,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:49:14,573 INFO L225 Difference]: With dead ends: 2214 [2020-11-22 12:49:14,573 INFO L226 Difference]: Without dead ends: 1934 [2020-11-22 12:49:14,574 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:49:14,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2020-11-22 12:49:14,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1934. [2020-11-22 12:49:14,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2020-11-22 12:49:14,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 6976 transitions. [2020-11-22 12:49:14,664 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 6976 transitions. Word has length 14 [2020-11-22 12:49:14,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:49:14,664 INFO L481 AbstractCegarLoop]: Abstraction has 1934 states and 6976 transitions. [2020-11-22 12:49:14,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 12:49:14,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 6976 transitions. [2020-11-22 12:49:14,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-22 12:49:14,668 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:49:14,668 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:49:14,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-22 12:49:14,669 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:49:14,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:49:14,670 INFO L82 PathProgramCache]: Analyzing trace with hash -498625880, now seen corresponding path program 1 times [2020-11-22 12:49:14,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:49:14,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735607926] [2020-11-22 12:49:14,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:49:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:49:14,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:49:14,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735607926] [2020-11-22 12:49:14,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:49:14,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 12:49:14,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018297050] [2020-11-22 12:49:14,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 12:49:14,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:49:14,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 12:49:14,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:49:14,816 INFO L87 Difference]: Start difference. First operand 1934 states and 6976 transitions. Second operand 6 states. [2020-11-22 12:49:14,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:49:14,943 INFO L93 Difference]: Finished difference Result 2102 states and 7412 transitions. [2020-11-22 12:49:14,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:49:14,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-22 12:49:14,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:49:14,969 INFO L225 Difference]: With dead ends: 2102 [2020-11-22 12:49:14,969 INFO L226 Difference]: Without dead ends: 1878 [2020-11-22 12:49:14,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-22 12:49:14,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2020-11-22 12:49:15,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1878. [2020-11-22 12:49:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1878 states. [2020-11-22 12:49:15,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 6728 transitions. [2020-11-22 12:49:15,056 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 6728 transitions. Word has length 15 [2020-11-22 12:49:15,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:49:15,057 INFO L481 AbstractCegarLoop]: Abstraction has 1878 states and 6728 transitions. [2020-11-22 12:49:15,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 12:49:15,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 6728 transitions. [2020-11-22 12:49:15,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-22 12:49:15,061 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:49:15,061 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:49:15,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-22 12:49:15,061 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:49:15,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:49:15,063 INFO L82 PathProgramCache]: Analyzing trace with hash -498850754, now seen corresponding path program 1 times [2020-11-22 12:49:15,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:49:15,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600247498] [2020-11-22 12:49:15,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:49:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:49:15,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:49:15,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600247498] [2020-11-22 12:49:15,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:49:15,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:49:15,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546242469] [2020-11-22 12:49:15,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 12:49:15,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:49:15,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 12:49:15,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:49:15,232 INFO L87 Difference]: Start difference. First operand 1878 states and 6728 transitions. Second operand 5 states. [2020-11-22 12:49:15,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:49:15,340 INFO L93 Difference]: Finished difference Result 2104 states and 7402 transitions. [2020-11-22 12:49:15,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:49:15,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-22 12:49:15,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:49:15,352 INFO L225 Difference]: With dead ends: 2104 [2020-11-22 12:49:15,353 INFO L226 Difference]: Without dead ends: 1894 [2020-11-22 12:49:15,354 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:49:15,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2020-11-22 12:49:15,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1894. [2020-11-22 12:49:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1894 states. [2020-11-22 12:49:15,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 6780 transitions. [2020-11-22 12:49:15,441 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 6780 transitions. Word has length 15 [2020-11-22 12:49:15,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:49:15,441 INFO L481 AbstractCegarLoop]: Abstraction has 1894 states and 6780 transitions. [2020-11-22 12:49:15,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 12:49:15,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 6780 transitions. [2020-11-22 12:49:15,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-22 12:49:15,448 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:49:15,448 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:49:15,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-22 12:49:15,449 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:49:15,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:49:15,449 INFO L82 PathProgramCache]: Analyzing trace with hash -503924834, now seen corresponding path program 2 times [2020-11-22 12:49:15,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:49:15,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792687208] [2020-11-22 12:49:15,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:49:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:49:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:49:15,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792687208] [2020-11-22 12:49:15,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:49:15,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 12:49:15,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946992780] [2020-11-22 12:49:15,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 12:49:15,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:49:15,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 12:49:15,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:49:15,594 INFO L87 Difference]: Start difference. First operand 1894 states and 6780 transitions. Second operand 6 states. [2020-11-22 12:49:15,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:49:15,748 INFO L93 Difference]: Finished difference Result 2020 states and 7086 transitions. [2020-11-22 12:49:15,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:49:15,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-22 12:49:15,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:49:15,758 INFO L225 Difference]: With dead ends: 2020 [2020-11-22 12:49:15,759 INFO L226 Difference]: Without dead ends: 1810 [2020-11-22 12:49:15,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-22 12:49:15,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2020-11-22 12:49:15,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1794. [2020-11-22 12:49:15,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2020-11-22 12:49:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6384 transitions. [2020-11-22 12:49:15,836 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6384 transitions. Word has length 15 [2020-11-22 12:49:15,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:49:15,837 INFO L481 AbstractCegarLoop]: Abstraction has 1794 states and 6384 transitions. [2020-11-22 12:49:15,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 12:49:15,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6384 transitions. [2020-11-22 12:49:15,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-22 12:49:15,841 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:49:15,841 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:49:15,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-22 12:49:15,842 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:49:15,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:49:15,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1722380032, now seen corresponding path program 1 times [2020-11-22 12:49:15,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:49:15,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560652476] [2020-11-22 12:49:15,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:49:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:49:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:49:15,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560652476] [2020-11-22 12:49:15,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:49:15,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 12:49:15,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747006398] [2020-11-22 12:49:15,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 12:49:15,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:49:15,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 12:49:15,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:49:15,939 INFO L87 Difference]: Start difference. First operand 1794 states and 6384 transitions. Second operand 6 states. [2020-11-22 12:49:16,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:49:16,129 INFO L93 Difference]: Finished difference Result 2086 states and 7272 transitions. [2020-11-22 12:49:16,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:49:16,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-22 12:49:16,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:49:16,141 INFO L225 Difference]: With dead ends: 2086 [2020-11-22 12:49:16,143 INFO L226 Difference]: Without dead ends: 1890 [2020-11-22 12:49:16,143 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-22 12:49:16,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2020-11-22 12:49:16,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1834. [2020-11-22 12:49:16,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1834 states. [2020-11-22 12:49:16,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 6464 transitions. [2020-11-22 12:49:16,235 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 6464 transitions. Word has length 16 [2020-11-22 12:49:16,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:49:16,236 INFO L481 AbstractCegarLoop]: Abstraction has 1834 states and 6464 transitions. [2020-11-22 12:49:16,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 12:49:16,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 6464 transitions. [2020-11-22 12:49:16,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-22 12:49:16,242 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:49:16,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:49:16,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-22 12:49:16,243 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:49:16,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:49:16,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1817459975, now seen corresponding path program 1 times [2020-11-22 12:49:16,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:49:16,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377445523] [2020-11-22 12:49:16,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:49:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:49:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:49:16,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377445523] [2020-11-22 12:49:16,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:49:16,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:49:16,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631039903] [2020-11-22 12:49:16,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 12:49:16,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:49:16,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 12:49:16,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 12:49:16,317 INFO L87 Difference]: Start difference. First operand 1834 states and 6464 transitions. Second operand 4 states. [2020-11-22 12:49:16,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:49:16,385 INFO L93 Difference]: Finished difference Result 1890 states and 6063 transitions. [2020-11-22 12:49:16,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:49:16,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-11-22 12:49:16,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:49:16,393 INFO L225 Difference]: With dead ends: 1890 [2020-11-22 12:49:16,395 INFO L226 Difference]: Without dead ends: 1458 [2020-11-22 12:49:16,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:49:16,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2020-11-22 12:49:16,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458. [2020-11-22 12:49:16,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2020-11-22 12:49:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 4662 transitions. [2020-11-22 12:49:16,453 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 4662 transitions. Word has length 17 [2020-11-22 12:49:16,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:49:16,453 INFO L481 AbstractCegarLoop]: Abstraction has 1458 states and 4662 transitions. [2020-11-22 12:49:16,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 12:49:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 4662 transitions. [2020-11-22 12:49:16,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-22 12:49:16,458 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:49:16,458 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:49:16,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-22 12:49:16,458 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:49:16,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:49:16,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1047833445, now seen corresponding path program 1 times [2020-11-22 12:49:16,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:49:16,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062953084] [2020-11-22 12:49:16,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:49:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:49:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:49:16,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062953084] [2020-11-22 12:49:16,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:49:16,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 12:49:16,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764674099] [2020-11-22 12:49:16,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 12:49:16,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:49:16,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 12:49:16,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:49:16,570 INFO L87 Difference]: Start difference. First operand 1458 states and 4662 transitions. Second operand 5 states. [2020-11-22 12:49:16,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:49:16,649 INFO L93 Difference]: Finished difference Result 1227 states and 3554 transitions. [2020-11-22 12:49:16,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:49:16,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-11-22 12:49:16,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:49:16,654 INFO L225 Difference]: With dead ends: 1227 [2020-11-22 12:49:16,654 INFO L226 Difference]: Without dead ends: 948 [2020-11-22 12:49:16,655 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:49:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2020-11-22 12:49:16,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 948. [2020-11-22 12:49:16,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2020-11-22 12:49:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2696 transitions. [2020-11-22 12:49:16,688 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2696 transitions. Word has length 18 [2020-11-22 12:49:16,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:49:16,688 INFO L481 AbstractCegarLoop]: Abstraction has 948 states and 2696 transitions. [2020-11-22 12:49:16,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 12:49:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2696 transitions. [2020-11-22 12:49:16,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-22 12:49:16,692 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:49:16,692 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:49:16,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-22 12:49:16,692 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:49:16,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:49:16,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1687389071, now seen corresponding path program 1 times [2020-11-22 12:49:16,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:49:16,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165448639] [2020-11-22 12:49:16,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:49:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:49:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:49:16,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165448639] [2020-11-22 12:49:16,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:49:16,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 12:49:16,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901317764] [2020-11-22 12:49:16,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 12:49:16,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:49:16,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 12:49:16,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:49:16,807 INFO L87 Difference]: Start difference. First operand 948 states and 2696 transitions. Second operand 6 states. [2020-11-22 12:49:16,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:49:16,920 INFO L93 Difference]: Finished difference Result 1728 states and 4662 transitions. [2020-11-22 12:49:16,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-22 12:49:16,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-22 12:49:16,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:49:16,924 INFO L225 Difference]: With dead ends: 1728 [2020-11-22 12:49:16,924 INFO L226 Difference]: Without dead ends: 1032 [2020-11-22 12:49:16,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-22 12:49:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2020-11-22 12:49:16,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 928. [2020-11-22 12:49:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2020-11-22 12:49:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 2501 transitions. [2020-11-22 12:49:16,962 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 2501 transitions. Word has length 20 [2020-11-22 12:49:16,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:49:16,963 INFO L481 AbstractCegarLoop]: Abstraction has 928 states and 2501 transitions. [2020-11-22 12:49:16,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 12:49:16,963 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 2501 transitions. [2020-11-22 12:49:16,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-22 12:49:16,966 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:49:16,966 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:49:16,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-22 12:49:16,967 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:49:16,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:49:16,967 INFO L82 PathProgramCache]: Analyzing trace with hash 219006172, now seen corresponding path program 1 times [2020-11-22 12:49:16,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:49:16,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204010886] [2020-11-22 12:49:16,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:49:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:49:17,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:49:17,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204010886] [2020-11-22 12:49:17,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:49:17,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-22 12:49:17,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493264140] [2020-11-22 12:49:17,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 12:49:17,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:49:17,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 12:49:17,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:49:17,081 INFO L87 Difference]: Start difference. First operand 928 states and 2501 transitions. Second operand 6 states. [2020-11-22 12:49:17,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:49:17,171 INFO L93 Difference]: Finished difference Result 782 states and 2050 transitions. [2020-11-22 12:49:17,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-22 12:49:17,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-22 12:49:17,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:49:17,174 INFO L225 Difference]: With dead ends: 782 [2020-11-22 12:49:17,175 INFO L226 Difference]: Without dead ends: 630 [2020-11-22 12:49:17,177 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-22 12:49:17,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-11-22 12:49:17,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 610. [2020-11-22 12:49:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2020-11-22 12:49:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1577 transitions. [2020-11-22 12:49:17,209 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 1577 transitions. Word has length 20 [2020-11-22 12:49:17,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:49:17,209 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 1577 transitions. [2020-11-22 12:49:17,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 12:49:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1577 transitions. [2020-11-22 12:49:17,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-22 12:49:17,211 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:49:17,211 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:49:17,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-22 12:49:17,212 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:49:17,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:49:17,212 INFO L82 PathProgramCache]: Analyzing trace with hash 961159876, now seen corresponding path program 1 times [2020-11-22 12:49:17,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:49:17,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667241008] [2020-11-22 12:49:17,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:49:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:49:17,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:49:17,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667241008] [2020-11-22 12:49:17,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:49:17,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-22 12:49:17,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912600535] [2020-11-22 12:49:17,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-22 12:49:17,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:49:17,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-22 12:49:17,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-22 12:49:17,403 INFO L87 Difference]: Start difference. First operand 610 states and 1577 transitions. Second operand 10 states. [2020-11-22 12:49:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:49:17,681 INFO L93 Difference]: Finished difference Result 893 states and 2223 transitions. [2020-11-22 12:49:17,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-22 12:49:17,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-11-22 12:49:17,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:49:17,685 INFO L225 Difference]: With dead ends: 893 [2020-11-22 12:49:17,685 INFO L226 Difference]: Without dead ends: 681 [2020-11-22 12:49:17,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-11-22 12:49:17,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2020-11-22 12:49:17,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 644. [2020-11-22 12:49:17,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2020-11-22 12:49:17,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1601 transitions. [2020-11-22 12:49:17,707 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1601 transitions. Word has length 23 [2020-11-22 12:49:17,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:49:17,708 INFO L481 AbstractCegarLoop]: Abstraction has 644 states and 1601 transitions. [2020-11-22 12:49:17,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-22 12:49:17,708 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1601 transitions. [2020-11-22 12:49:17,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-22 12:49:17,713 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:49:17,714 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:49:17,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-22 12:49:17,714 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:49:17,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:49:17,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1284568559, now seen corresponding path program 1 times [2020-11-22 12:49:17,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:49:17,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308245453] [2020-11-22 12:49:17,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:49:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:49:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:49:17,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308245453] [2020-11-22 12:49:17,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:49:17,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-22 12:49:17,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382188617] [2020-11-22 12:49:17,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-22 12:49:17,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:49:17,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-22 12:49:17,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-22 12:49:17,974 INFO L87 Difference]: Start difference. First operand 644 states and 1601 transitions. Second operand 8 states. [2020-11-22 12:49:18,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:49:18,184 INFO L93 Difference]: Finished difference Result 752 states and 1812 transitions. [2020-11-22 12:49:18,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-22 12:49:18,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-11-22 12:49:18,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:49:18,186 INFO L225 Difference]: With dead ends: 752 [2020-11-22 12:49:18,186 INFO L226 Difference]: Without dead ends: 604 [2020-11-22 12:49:18,187 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-22 12:49:18,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-11-22 12:49:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 598. [2020-11-22 12:49:18,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2020-11-22 12:49:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 1449 transitions. [2020-11-22 12:49:18,210 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 1449 transitions. Word has length 23 [2020-11-22 12:49:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:49:18,210 INFO L481 AbstractCegarLoop]: Abstraction has 598 states and 1449 transitions. [2020-11-22 12:49:18,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-22 12:49:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1449 transitions. [2020-11-22 12:49:18,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-22 12:49:18,213 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:49:18,213 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:49:18,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-22 12:49:18,213 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:49:18,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:49:18,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2006598366, now seen corresponding path program 2 times [2020-11-22 12:49:18,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:49:18,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61426829] [2020-11-22 12:49:18,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:49:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:49:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:49:18,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61426829] [2020-11-22 12:49:18,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:49:18,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 12:49:18,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061659462] [2020-11-22 12:49:18,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 12:49:18,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:49:18,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 12:49:18,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:49:18,321 INFO L87 Difference]: Start difference. First operand 598 states and 1449 transitions. Second operand 5 states. [2020-11-22 12:49:18,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:49:18,375 INFO L93 Difference]: Finished difference Result 681 states and 1580 transitions. [2020-11-22 12:49:18,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:49:18,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-11-22 12:49:18,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:49:18,377 INFO L225 Difference]: With dead ends: 681 [2020-11-22 12:49:18,377 INFO L226 Difference]: Without dead ends: 306 [2020-11-22 12:49:18,378 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-22 12:49:18,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-11-22 12:49:18,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2020-11-22 12:49:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-11-22 12:49:18,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 665 transitions. [2020-11-22 12:49:18,392 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 665 transitions. Word has length 23 [2020-11-22 12:49:18,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:49:18,392 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 665 transitions. [2020-11-22 12:49:18,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 12:49:18,393 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 665 transitions. [2020-11-22 12:49:18,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-22 12:49:18,394 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:49:18,394 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:49:18,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-22 12:49:18,395 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:49:18,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:49:18,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1492688256, now seen corresponding path program 1 times [2020-11-22 12:49:18,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:49:18,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464182242] [2020-11-22 12:49:18,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:49:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:49:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:49:18,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464182242] [2020-11-22 12:49:18,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:49:18,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-22 12:49:18,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159454884] [2020-11-22 12:49:18,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-22 12:49:18,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:49:18,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-22 12:49:18,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-22 12:49:18,519 INFO L87 Difference]: Start difference. First operand 306 states and 665 transitions. Second operand 7 states. [2020-11-22 12:49:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:49:18,617 INFO L93 Difference]: Finished difference Result 277 states and 608 transitions. [2020-11-22 12:49:18,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-22 12:49:18,618 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-11-22 12:49:18,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:49:18,619 INFO L225 Difference]: With dead ends: 277 [2020-11-22 12:49:18,619 INFO L226 Difference]: Without dead ends: 64 [2020-11-22 12:49:18,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-22 12:49:18,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-22 12:49:18,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-11-22 12:49:18,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-22 12:49:18,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 122 transitions. [2020-11-22 12:49:18,622 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 122 transitions. Word has length 23 [2020-11-22 12:49:18,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:49:18,622 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 122 transitions. [2020-11-22 12:49:18,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-22 12:49:18,622 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 122 transitions. [2020-11-22 12:49:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-22 12:49:18,623 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:49:18,624 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:49:18,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-22 12:49:18,624 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:49:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:49:18,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1849601120, now seen corresponding path program 1 times [2020-11-22 12:49:18,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:49:18,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760329928] [2020-11-22 12:49:18,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:49:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-22 12:49:18,690 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-22 12:49:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-22 12:49:18,736 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-22 12:49:18,802 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-22 12:49:18,802 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-22 12:49:18,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-22 12:49:18,844 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,845 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [795] [2020-11-22 12:49:18,847 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,847 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,847 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,847 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,848 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,848 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,848 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,848 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,848 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,851 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,851 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,851 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,852 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,852 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,853 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,854 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,854 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,854 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,854 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,854 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,855 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,855 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,855 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,855 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,855 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,856 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,861 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,862 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,862 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,862 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,863 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,863 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,863 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,864 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,864 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,864 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,864 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,864 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,865 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,865 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,865 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,865 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,865 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,866 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,866 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,866 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,866 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,866 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:18,867 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:18,867 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:49:19 BasicIcfg [2020-11-22 12:49:19,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-22 12:49:19,003 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-22 12:49:19,003 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-22 12:49:19,003 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-22 12:49:19,004 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:49:02" (3/4) ... [2020-11-22 12:49:19,006 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-22 12:49:19,020 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,020 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [795] [2020-11-22 12:49:19,021 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,021 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,021 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,021 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,022 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,022 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,022 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,022 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,022 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,022 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,023 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,023 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,023 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,023 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,023 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,024 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,024 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,024 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,024 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,024 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,025 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,025 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,025 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,025 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,025 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,026 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,026 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,026 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,026 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,026 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,026 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,027 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,027 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,027 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,027 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,027 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,027 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,028 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,028 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,028 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,029 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,029 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,030 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,030 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,030 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,030 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,030 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,030 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,031 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,031 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,031 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:49:19,031 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:49:19,153 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d8afd670-0810-4e0b-9bfe-9d03891fc3c4/bin/utaipan/witness.graphml [2020-11-22 12:49:19,153 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-22 12:49:19,155 INFO L168 Benchmark]: Toolchain (without parser) took 20363.36 ms. Allocated memory was 115.3 MB in the beginning and 323.0 MB in the end (delta: 207.6 MB). Free memory was 85.9 MB in the beginning and 252.0 MB in the end (delta: -166.1 MB). Peak memory consumption was 39.7 MB. Max. memory is 16.1 GB. [2020-11-22 12:49:19,155 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 86.0 MB. Free memory is still 44.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-22 12:49:19,156 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.19 ms. Allocated memory is still 115.3 MB. Free memory was 85.6 MB in the beginning and 66.8 MB in the end (delta: 18.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-22 12:49:19,156 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.63 ms. Allocated memory is still 115.3 MB. Free memory was 66.6 MB in the beginning and 63.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-22 12:49:19,157 INFO L168 Benchmark]: Boogie Preprocessor took 87.96 ms. Allocated memory is still 115.3 MB. Free memory was 63.9 MB in the beginning and 61.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-22 12:49:19,159 INFO L168 Benchmark]: RCFGBuilder took 2833.09 ms. Allocated memory was 115.3 MB in the beginning and 144.7 MB in the end (delta: 29.4 MB). Free memory was 61.5 MB in the beginning and 52.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 41.8 MB. Max. memory is 16.1 GB. [2020-11-22 12:49:19,159 INFO L168 Benchmark]: TraceAbstraction took 16425.36 ms. Allocated memory was 144.7 MB in the beginning and 323.0 MB in the end (delta: 178.3 MB). Free memory was 52.5 MB in the beginning and 270.9 MB in the end (delta: -218.4 MB). Peak memory consumption was 139.2 MB. Max. memory is 16.1 GB. [2020-11-22 12:49:19,160 INFO L168 Benchmark]: Witness Printer took 150.09 ms. Allocated memory is still 323.0 MB. Free memory was 270.9 MB in the beginning and 252.0 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-22 12:49:19,162 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.26 ms. Allocated memory is still 86.0 MB. Free memory is still 44.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 743.19 ms. Allocated memory is still 115.3 MB. Free memory was 85.6 MB in the beginning and 66.8 MB in the end (delta: 18.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 115.63 ms. Allocated memory is still 115.3 MB. Free memory was 66.6 MB in the beginning and 63.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 87.96 ms. Allocated memory is still 115.3 MB. Free memory was 63.9 MB in the beginning and 61.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2833.09 ms. Allocated memory was 115.3 MB in the beginning and 144.7 MB in the end (delta: 29.4 MB). Free memory was 61.5 MB in the beginning and 52.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 41.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 16425.36 ms. Allocated memory was 144.7 MB in the beginning and 323.0 MB in the end (delta: 178.3 MB). Free memory was 52.5 MB in the beginning and 270.9 MB in the end (delta: -218.4 MB). Peak memory consumption was 139.2 MB. Max. memory is 16.1 GB. * Witness Printer took 150.09 ms. Allocated memory is still 323.0 MB. Free memory was 270.9 MB in the beginning and 252.0 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1738 VarBasedMoverChecksPositive, 78 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 47 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 196 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.2s, 126 PlacesBefore, 45 PlacesAfterwards, 116 TransitionsBefore, 33 TransitionsAfterwards, 2622 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 98 TotalNumberOfCompositions, 6442 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1537; [L835] FCALL, FORK 0 pthread_create(&t1537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1538; [L837] FCALL, FORK 0 pthread_create(&t1538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1539; [L839] FCALL, FORK 0 pthread_create(&t1539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1540; [L841] FCALL, FORK 0 pthread_create(&t1540, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L761] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix057_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.0s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 734 SDtfs, 950 SDslu, 1515 SDs, 0 SdLazy, 614 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3082occurred 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: 1.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 559 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 32058 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...