./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix046_rmo.opt.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_8e9b6ae2-8c3d-4327-8646-0f949b84139c/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_8e9b6ae2-8c3d-4327-8646-0f949b84139c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8e9b6ae2-8c3d-4327-8646-0f949b84139c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8e9b6ae2-8c3d-4327-8646-0f949b84139c/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix046_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8e9b6ae2-8c3d-4327-8646-0f949b84139c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8e9b6ae2-8c3d-4327-8646-0f949b84139c/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 ebe4efc711d092ae1c7491acf4c467474fa27626 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:58:34,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-22 12:58:34,917 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-22 12:58:34,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-22 12:58:34,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-22 12:58:34,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-22 12:58:34,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-22 12:58:35,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-22 12:58:35,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-22 12:58:35,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-22 12:58:35,017 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-22 12:58:35,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-22 12:58:35,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-22 12:58:35,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-22 12:58:35,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-22 12:58:35,027 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-22 12:58:35,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-22 12:58:35,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-22 12:58:35,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-22 12:58:35,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-22 12:58:35,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-22 12:58:35,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-22 12:58:35,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-22 12:58:35,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-22 12:58:35,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-22 12:58:35,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-22 12:58:35,058 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-22 12:58:35,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-22 12:58:35,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-22 12:58:35,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-22 12:58:35,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-22 12:58:35,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-22 12:58:35,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-22 12:58:35,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-22 12:58:35,069 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-22 12:58:35,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-22 12:58:35,070 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-22 12:58:35,070 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-22 12:58:35,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-22 12:58:35,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-22 12:58:35,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-22 12:58:35,075 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8e9b6ae2-8c3d-4327-8646-0f949b84139c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-22 12:58:35,118 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-22 12:58:35,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-22 12:58:35,120 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-22 12:58:35,120 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-22 12:58:35,121 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-22 12:58:35,121 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-22 12:58:35,121 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-22 12:58:35,121 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-22 12:58:35,122 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-22 12:58:35,122 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-22 12:58:35,123 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-22 12:58:35,123 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-22 12:58:35,124 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-22 12:58:35,124 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-22 12:58:35,124 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-22 12:58:35,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-22 12:58:35,125 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-22 12:58:35,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-22 12:58:35,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-22 12:58:35,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-22 12:58:35,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-22 12:58:35,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-22 12:58:35,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-22 12:58:35,127 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-22 12:58:35,127 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-22 12:58:35,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-22 12:58:35,128 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-22 12:58:35,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-22 12:58:35,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-22 12:58:35,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-22 12:58:35,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-22 12:58:35,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-22 12:58:35,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-22 12:58:35,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-22 12:58:35,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-22 12:58:35,132 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-22 12:58:35,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-22 12:58:35,132 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-22 12:58:35,132 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-22 12:58:35,133 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-22 12:58:35,133 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_8e9b6ae2-8c3d-4327-8646-0f949b84139c/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_8e9b6ae2-8c3d-4327-8646-0f949b84139c/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 -> ebe4efc711d092ae1c7491acf4c467474fa27626 [2020-11-22 12:58:35,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-22 12:58:35,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-22 12:58:35,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-22 12:58:35,491 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-22 12:58:35,492 INFO L275 PluginConnector]: CDTParser initialized [2020-11-22 12:58:35,493 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8e9b6ae2-8c3d-4327-8646-0f949b84139c/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix046_rmo.opt.i [2020-11-22 12:58:35,584 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e9b6ae2-8c3d-4327-8646-0f949b84139c/bin/utaipan/data/f51e03099/965f7fd10fe64737b33c16127d5c4062/FLAG1718ad297 [2020-11-22 12:58:36,190 INFO L306 CDTParser]: Found 1 translation units. [2020-11-22 12:58:36,191 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8e9b6ae2-8c3d-4327-8646-0f949b84139c/sv-benchmarks/c/pthread-wmm/mix046_rmo.opt.i [2020-11-22 12:58:36,213 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e9b6ae2-8c3d-4327-8646-0f949b84139c/bin/utaipan/data/f51e03099/965f7fd10fe64737b33c16127d5c4062/FLAG1718ad297 [2020-11-22 12:58:36,431 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8e9b6ae2-8c3d-4327-8646-0f949b84139c/bin/utaipan/data/f51e03099/965f7fd10fe64737b33c16127d5c4062 [2020-11-22 12:58:36,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-22 12:58:36,434 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-22 12:58:36,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-22 12:58:36,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-22 12:58:36,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-22 12:58:36,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:58:36" (1/1) ... [2020-11-22 12:58:36,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49cbcd0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:36, skipping insertion in model container [2020-11-22 12:58:36,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:58:36" (1/1) ... [2020-11-22 12:58:36,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-22 12:58:36,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-22 12:58:36,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-22 12:58:36,930 INFO L203 MainTranslator]: Completed pre-run [2020-11-22 12:58:36,988 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-22 12:58:37,087 INFO L208 MainTranslator]: Completed translation [2020-11-22 12:58:37,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:37 WrapperNode [2020-11-22 12:58:37,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-22 12:58:37,090 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-22 12:58:37,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-22 12:58:37,091 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-22 12:58:37,099 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:58:37" (1/1) ... [2020-11-22 12:58:37,137 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:58:37" (1/1) ... [2020-11-22 12:58:37,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-22 12:58:37,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-22 12:58:37,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-22 12:58:37,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-22 12:58:37,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:37" (1/1) ... [2020-11-22 12:58:37,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:37" (1/1) ... [2020-11-22 12:58:37,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:37" (1/1) ... [2020-11-22 12:58:37,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:37" (1/1) ... [2020-11-22 12:58:37,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:37" (1/1) ... [2020-11-22 12:58:37,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:37" (1/1) ... [2020-11-22 12:58:37,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:37" (1/1) ... [2020-11-22 12:58:37,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-22 12:58:37,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-22 12:58:37,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-22 12:58:37,238 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-22 12:58:37,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e9b6ae2-8c3d-4327-8646-0f949b84139c/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:58:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-22 12:58:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-22 12:58:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-22 12:58:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-22 12:58:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-22 12:58:37,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-22 12:58:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-22 12:58:37,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-22 12:58:37,327 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-22 12:58:37,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-22 12:58:37,327 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-22 12:58:37,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-22 12:58:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-22 12:58:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-22 12:58:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-22 12:58:37,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-22 12:58:37,330 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:58:39,604 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-22 12:58:39,604 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-22 12:58:39,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:58:39 BoogieIcfgContainer [2020-11-22 12:58:39,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-22 12:58:39,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-22 12:58:39,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-22 12:58:39,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-22 12:58:39,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:58:36" (1/3) ... [2020-11-22 12:58:39,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16979d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:58:39, skipping insertion in model container [2020-11-22 12:58:39,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:37" (2/3) ... [2020-11-22 12:58:39,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16979d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:58:39, skipping insertion in model container [2020-11-22 12:58:39,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:58:39" (3/3) ... [2020-11-22 12:58:39,616 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_rmo.opt.i [2020-11-22 12:58:39,630 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-22 12:58:39,630 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-22 12:58:39,634 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-22 12:58:39,635 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-22 12:58:39,695 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,696 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,696 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,697 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,697 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,697 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,699 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,699 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,705 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,705 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,705 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,705 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,707 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,707 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,707 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,707 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,711 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,712 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,713 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,715 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,715 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,716 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,716 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,716 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,716 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,716 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,716 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,717 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,721 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,722 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,725 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,725 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:58:39,729 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-22 12:58:39,741 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-22 12:58:39,765 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-22 12:58:39,765 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-22 12:58:39,765 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-22 12:58:39,765 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-22 12:58:39,765 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-22 12:58:39,766 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-22 12:58:39,766 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-22 12:58:39,766 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-22 12:58:39,779 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-22 12:58:39,781 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-22 12:58:39,784 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-22 12:58:39,786 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 131 places, 121 transitions, 262 flow [2020-11-22 12:58:39,838 INFO L129 PetriNetUnfolder]: 3/117 cut-off events. [2020-11-22 12:58:39,838 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-22 12:58:39,842 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-11-22 12:58:39,847 INFO L116 LiptonReduction]: Number of co-enabled transitions 2830 [2020-11-22 12:58:39,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 12:58:39,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:58:40,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:58:40,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:58:40,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:58:40,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:58:40,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:58:40,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:58:40,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:58:40,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:58:40,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:58:40,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:58:40,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:58:40,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:58:40,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:58:40,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:58:40,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:58:40,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:58:40,793 WARN L193 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-22 12:58:40,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:58:40,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:58:40,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:58:40,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:58:40,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:58:40,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:58:41,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:58:41,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:58:41,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:58:41,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:58:41,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:58:41,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:58:41,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:58:41,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:58:41,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:58:41,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:58:41,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-22 12:58:41,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:58:41,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-22 12:58:41,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:58:41,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-22 12:58:41,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:58:41,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-22 12:58:41,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:58:42,419 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-11-22 12:58:42,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-11-22 12:58:42,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:58:42,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-22 12:58:42,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:58:43,200 WARN L193 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-11-22 12:58:43,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-22 12:58:43,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:58:43,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-22 12:58:43,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:58:43,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-22 12:58:43,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:58:43,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-22 12:58:43,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:58:43,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:58:43,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:58:43,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:58:43,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:58:43,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:58:43,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:58:43,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:58:43,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:58:43,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:58:43,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:58:43,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:58:43,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:58:43,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:58:43,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:58:43,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:58:43,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:58:44,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:58:44,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:58:44,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:58:44,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:58:44,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:58:44,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:58:44,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:58:44,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:58:44,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:58:44,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:58:44,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:58:44,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:58:44,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:58:44,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:58:44,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:58:44,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:58:44,560 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-22 12:58:44,864 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-11-22 12:58:45,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 12:58:45,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:58:46,259 WARN L193 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-11-22 12:58:46,422 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-11-22 12:58:46,427 INFO L131 LiptonReduction]: Checked pairs total: 7226 [2020-11-22 12:58:46,428 INFO L133 LiptonReduction]: Total number of compositions: 103 [2020-11-22 12:58:46,432 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-11-22 12:58:46,704 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3562 states. [2020-11-22 12:58:46,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states. [2020-11-22 12:58:46,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-22 12:58:46,715 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:58:46,715 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:58:46,716 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:58:46,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:58:46,725 INFO L82 PathProgramCache]: Analyzing trace with hash 961632752, now seen corresponding path program 1 times [2020-11-22 12:58:46,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:58:46,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373719203] [2020-11-22 12:58:46,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:58:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:58:47,042 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:58:47,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373719203] [2020-11-22 12:58:47,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:58:47,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-22 12:58:47,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673926043] [2020-11-22 12:58:47,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 12:58:47,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:58:47,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 12:58:47,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 12:58:47,066 INFO L87 Difference]: Start difference. First operand 3562 states. Second operand 3 states. [2020-11-22 12:58:47,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:58:47,242 INFO L93 Difference]: Finished difference Result 3082 states and 12048 transitions. [2020-11-22 12:58:47,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 12:58:47,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-22 12:58:47,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:58:47,304 INFO L225 Difference]: With dead ends: 3082 [2020-11-22 12:58:47,304 INFO L226 Difference]: Without dead ends: 2602 [2020-11-22 12:58:47,306 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:58:47,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-11-22 12:58:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-11-22 12:58:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-11-22 12:58:47,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-11-22 12:58:47,506 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2020-11-22 12:58:47,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:58:47,508 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-11-22 12:58:47,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 12:58:47,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-11-22 12:58:47,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-22 12:58:47,518 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:58:47,519 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:58:47,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-22 12:58:47,519 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:58:47,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:58:47,522 INFO L82 PathProgramCache]: Analyzing trace with hash 570752080, now seen corresponding path program 1 times [2020-11-22 12:58:47,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:58:47,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966312207] [2020-11-22 12:58:47,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:58:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:58:47,743 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:58:47,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966312207] [2020-11-22 12:58:47,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:58:47,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-22 12:58:47,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594778320] [2020-11-22 12:58:47,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 12:58:47,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:58:47,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 12:58:47,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 12:58:47,746 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states. [2020-11-22 12:58:47,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:58:47,978 INFO L93 Difference]: Finished difference Result 3066 states and 11500 transitions. [2020-11-22 12:58:47,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:58:47,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-22 12:58:47,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:58:48,011 INFO L225 Difference]: With dead ends: 3066 [2020-11-22 12:58:48,011 INFO L226 Difference]: Without dead ends: 2586 [2020-11-22 12:58:48,012 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:58:48,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2020-11-22 12:58:48,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 2586. [2020-11-22 12:58:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2586 states. [2020-11-22 12:58:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 9988 transitions. [2020-11-22 12:58:48,143 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 9988 transitions. Word has length 12 [2020-11-22 12:58:48,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:58:48,144 INFO L481 AbstractCegarLoop]: Abstraction has 2586 states and 9988 transitions. [2020-11-22 12:58:48,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 12:58:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 9988 transitions. [2020-11-22 12:58:48,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-22 12:58:48,146 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:58:48,146 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:58:48,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-22 12:58:48,147 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:58:48,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:58:48,157 INFO L82 PathProgramCache]: Analyzing trace with hash 526166796, now seen corresponding path program 1 times [2020-11-22 12:58:48,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:58:48,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559660786] [2020-11-22 12:58:48,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:58:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:58:48,308 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:58:48,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559660786] [2020-11-22 12:58:48,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:58:48,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-22 12:58:48,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772853511] [2020-11-22 12:58:48,310 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 12:58:48,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:58:48,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 12:58:48,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 12:58:48,311 INFO L87 Difference]: Start difference. First operand 2586 states and 9988 transitions. Second operand 4 states. [2020-11-22 12:58:48,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:58:48,411 INFO L93 Difference]: Finished difference Result 2754 states and 10314 transitions. [2020-11-22 12:58:48,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:58:48,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-22 12:58:48,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:58:48,434 INFO L225 Difference]: With dead ends: 2754 [2020-11-22 12:58:48,434 INFO L226 Difference]: Without dead ends: 2282 [2020-11-22 12:58:48,435 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:58:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2020-11-22 12:58:48,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2282. [2020-11-22 12:58:48,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2020-11-22 12:58:48,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8688 transitions. [2020-11-22 12:58:48,532 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8688 transitions. Word has length 13 [2020-11-22 12:58:48,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:58:48,533 INFO L481 AbstractCegarLoop]: Abstraction has 2282 states and 8688 transitions. [2020-11-22 12:58:48,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 12:58:48,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8688 transitions. [2020-11-22 12:58:48,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-22 12:58:48,536 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:58:48,536 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:58:48,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-22 12:58:48,536 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:58:48,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:58:48,537 INFO L82 PathProgramCache]: Analyzing trace with hash -997779623, now seen corresponding path program 1 times [2020-11-22 12:58:48,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:58:48,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853828116] [2020-11-22 12:58:48,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:58:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:58:48,737 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:58:48,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853828116] [2020-11-22 12:58:48,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:58:48,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-22 12:58:48,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295667740] [2020-11-22 12:58:48,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 12:58:48,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:58:48,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 12:58:48,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 12:58:48,740 INFO L87 Difference]: Start difference. First operand 2282 states and 8688 transitions. Second operand 4 states. [2020-11-22 12:58:48,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:58:48,810 INFO L93 Difference]: Finished difference Result 2538 states and 9408 transitions. [2020-11-22 12:58:48,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:58:48,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-22 12:58:48,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:58:48,836 INFO L225 Difference]: With dead ends: 2538 [2020-11-22 12:58:48,836 INFO L226 Difference]: Without dead ends: 2218 [2020-11-22 12:58:48,837 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:58:48,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2020-11-22 12:58:48,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2218. [2020-11-22 12:58:48,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2020-11-22 12:58:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 8400 transitions. [2020-11-22 12:58:48,925 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 8400 transitions. Word has length 14 [2020-11-22 12:58:48,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:58:48,926 INFO L481 AbstractCegarLoop]: Abstraction has 2218 states and 8400 transitions. [2020-11-22 12:58:48,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 12:58:48,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 8400 transitions. [2020-11-22 12:58:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-22 12:58:48,930 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:58:48,930 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:58:48,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-22 12:58:48,931 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:58:48,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:58:48,931 INFO L82 PathProgramCache]: Analyzing trace with hash -894564587, now seen corresponding path program 1 times [2020-11-22 12:58:48,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:58:48,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545252165] [2020-11-22 12:58:48,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:58:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:58:49,104 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:58:49,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545252165] [2020-11-22 12:58:49,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:58:49,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 12:58:49,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5310072] [2020-11-22 12:58:49,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 12:58:49,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:58:49,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 12:58:49,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:58:49,107 INFO L87 Difference]: Start difference. First operand 2218 states and 8400 transitions. Second operand 6 states. [2020-11-22 12:58:49,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:58:49,288 INFO L93 Difference]: Finished difference Result 2410 states and 8888 transitions. [2020-11-22 12:58:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:58:49,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-22 12:58:49,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:58:49,364 INFO L225 Difference]: With dead ends: 2410 [2020-11-22 12:58:49,365 INFO L226 Difference]: Without dead ends: 2122 [2020-11-22 12:58:49,365 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-22 12:58:49,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-11-22 12:58:49,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-11-22 12:58:49,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-11-22 12:58:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 7976 transitions. [2020-11-22 12:58:49,444 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 7976 transitions. Word has length 15 [2020-11-22 12:58:49,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:58:49,444 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 7976 transitions. [2020-11-22 12:58:49,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 12:58:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 7976 transitions. [2020-11-22 12:58:49,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-22 12:58:49,448 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:58:49,448 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:58:49,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-22 12:58:49,449 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:58:49,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:58:49,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1811455833, now seen corresponding path program 1 times [2020-11-22 12:58:49,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:58:49,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862049972] [2020-11-22 12:58:49,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:58:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:58:49,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:58:49,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862049972] [2020-11-22 12:58:49,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:58:49,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-22 12:58:49,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717668405] [2020-11-22 12:58:49,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-22 12:58:49,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:58:49,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-22 12:58:49,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-22 12:58:49,594 INFO L87 Difference]: Start difference. First operand 2122 states and 7976 transitions. Second operand 7 states. [2020-11-22 12:58:49,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:58:49,762 INFO L93 Difference]: Finished difference Result 2682 states and 10032 transitions. [2020-11-22 12:58:49,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-22 12:58:49,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-11-22 12:58:49,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:58:49,793 INFO L225 Difference]: With dead ends: 2682 [2020-11-22 12:58:49,793 INFO L226 Difference]: Without dead ends: 2490 [2020-11-22 12:58:49,794 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-22 12:58:49,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2490 states. [2020-11-22 12:58:49,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2490 to 2282. [2020-11-22 12:58:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2020-11-22 12:58:49,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8632 transitions. [2020-11-22 12:58:49,919 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8632 transitions. Word has length 16 [2020-11-22 12:58:49,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:58:49,919 INFO L481 AbstractCegarLoop]: Abstraction has 2282 states and 8632 transitions. [2020-11-22 12:58:49,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-22 12:58:49,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8632 transitions. [2020-11-22 12:58:49,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-22 12:58:49,924 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:58:49,924 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:58:49,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-22 12:58:49,924 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:58:49,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:58:49,925 INFO L82 PathProgramCache]: Analyzing trace with hash -2075999913, now seen corresponding path program 2 times [2020-11-22 12:58:49,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:58:49,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731950952] [2020-11-22 12:58:49,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:58:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:58:50,088 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:58:50,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731950952] [2020-11-22 12:58:50,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:58:50,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-22 12:58:50,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828824260] [2020-11-22 12:58:50,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-22 12:58:50,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:58:50,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-22 12:58:50,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-22 12:58:50,090 INFO L87 Difference]: Start difference. First operand 2282 states and 8632 transitions. Second operand 7 states. [2020-11-22 12:58:50,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:58:50,532 INFO L93 Difference]: Finished difference Result 2762 states and 10248 transitions. [2020-11-22 12:58:50,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-22 12:58:50,537 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-11-22 12:58:50,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:58:50,550 INFO L225 Difference]: With dead ends: 2762 [2020-11-22 12:58:50,550 INFO L226 Difference]: Without dead ends: 2506 [2020-11-22 12:58:50,551 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-11-22 12:58:50,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2020-11-22 12:58:50,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2346. [2020-11-22 12:58:50,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2346 states. [2020-11-22 12:58:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 8744 transitions. [2020-11-22 12:58:50,653 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 8744 transitions. Word has length 16 [2020-11-22 12:58:50,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:58:50,654 INFO L481 AbstractCegarLoop]: Abstraction has 2346 states and 8744 transitions. [2020-11-22 12:58:50,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-22 12:58:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 8744 transitions. [2020-11-22 12:58:50,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-22 12:58:50,663 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:58:50,663 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:58:50,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-22 12:58:50,663 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:58:50,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:58:50,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1979324700, now seen corresponding path program 1 times [2020-11-22 12:58:50,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:58:50,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397692870] [2020-11-22 12:58:50,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:58:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:58:50,948 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:58:50,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397692870] [2020-11-22 12:58:50,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:58:50,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-22 12:58:50,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143203613] [2020-11-22 12:58:50,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-22 12:58:50,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:58:50,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-22 12:58:50,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-22 12:58:50,950 INFO L87 Difference]: Start difference. First operand 2346 states and 8744 transitions. Second operand 8 states. [2020-11-22 12:58:51,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:58:51,155 INFO L93 Difference]: Finished difference Result 2922 states and 10872 transitions. [2020-11-22 12:58:51,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-22 12:58:51,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-11-22 12:58:51,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:58:51,171 INFO L225 Difference]: With dead ends: 2922 [2020-11-22 12:58:51,171 INFO L226 Difference]: Without dead ends: 2794 [2020-11-22 12:58:51,172 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-22 12:58:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2794 states. [2020-11-22 12:58:51,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2794 to 2506. [2020-11-22 12:58:51,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2020-11-22 12:58:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 9400 transitions. [2020-11-22 12:58:51,292 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 9400 transitions. Word has length 17 [2020-11-22 12:58:51,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:58:51,292 INFO L481 AbstractCegarLoop]: Abstraction has 2506 states and 9400 transitions. [2020-11-22 12:58:51,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-22 12:58:51,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 9400 transitions. [2020-11-22 12:58:51,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-22 12:58:51,299 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:58:51,299 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:58:51,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-22 12:58:51,299 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:58:51,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:58:51,300 INFO L82 PathProgramCache]: Analyzing trace with hash 68230876, now seen corresponding path program 2 times [2020-11-22 12:58:51,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:58:51,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219491909] [2020-11-22 12:58:51,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:58:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:58:51,478 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:58:51,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219491909] [2020-11-22 12:58:51,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:58:51,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-22 12:58:51,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139090518] [2020-11-22 12:58:51,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-22 12:58:51,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:58:51,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-22 12:58:51,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-11-22 12:58:51,480 INFO L87 Difference]: Start difference. First operand 2506 states and 9400 transitions. Second operand 8 states. [2020-11-22 12:58:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:58:51,674 INFO L93 Difference]: Finished difference Result 2506 states and 9304 transitions. [2020-11-22 12:58:51,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-22 12:58:51,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-11-22 12:58:51,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:58:51,689 INFO L225 Difference]: With dead ends: 2506 [2020-11-22 12:58:51,689 INFO L226 Difference]: Without dead ends: 2378 [2020-11-22 12:58:51,690 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-11-22 12:58:51,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2020-11-22 12:58:51,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 1930. [2020-11-22 12:58:51,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1930 states. [2020-11-22 12:58:51,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 7176 transitions. [2020-11-22 12:58:51,769 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 7176 transitions. Word has length 17 [2020-11-22 12:58:51,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:58:51,771 INFO L481 AbstractCegarLoop]: Abstraction has 1930 states and 7176 transitions. [2020-11-22 12:58:51,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-22 12:58:51,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 7176 transitions. [2020-11-22 12:58:51,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-22 12:58:51,776 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:58:51,777 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:58:51,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-22 12:58:51,777 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:58:51,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:58:51,777 INFO L82 PathProgramCache]: Analyzing trace with hash -684451050, now seen corresponding path program 1 times [2020-11-22 12:58:51,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:58:51,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621928332] [2020-11-22 12:58:51,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:58:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:58:51,857 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:58:51,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621928332] [2020-11-22 12:58:51,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:58:51,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:58:51,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151668789] [2020-11-22 12:58:51,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 12:58:51,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:58:51,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 12:58:51,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 12:58:51,859 INFO L87 Difference]: Start difference. First operand 1930 states and 7176 transitions. Second operand 4 states. [2020-11-22 12:58:51,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:58:51,904 INFO L93 Difference]: Finished difference Result 1990 states and 6760 transitions. [2020-11-22 12:58:51,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:58:51,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-11-22 12:58:51,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:58:51,911 INFO L225 Difference]: With dead ends: 1990 [2020-11-22 12:58:51,911 INFO L226 Difference]: Without dead ends: 1510 [2020-11-22 12:58:51,912 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:58:51,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2020-11-22 12:58:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1510. [2020-11-22 12:58:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2020-11-22 12:58:51,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 5076 transitions. [2020-11-22 12:58:51,961 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 5076 transitions. Word has length 17 [2020-11-22 12:58:51,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:58:51,961 INFO L481 AbstractCegarLoop]: Abstraction has 1510 states and 5076 transitions. [2020-11-22 12:58:51,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 12:58:51,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 5076 transitions. [2020-11-22 12:58:51,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-22 12:58:51,965 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:58:51,965 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:58:51,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-22 12:58:51,966 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:58:51,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:58:51,966 INFO L82 PathProgramCache]: Analyzing trace with hash -100869773, now seen corresponding path program 1 times [2020-11-22 12:58:51,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:58:51,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158744034] [2020-11-22 12:58:51,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:58:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:58:52,043 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:58:52,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158744034] [2020-11-22 12:58:52,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:58:52,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 12:58:52,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209003365] [2020-11-22 12:58:52,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 12:58:52,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:58:52,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 12:58:52,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:58:52,045 INFO L87 Difference]: Start difference. First operand 1510 states and 5076 transitions. Second operand 5 states. [2020-11-22 12:58:52,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:58:52,111 INFO L93 Difference]: Finished difference Result 1286 states and 3965 transitions. [2020-11-22 12:58:52,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:58:52,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-11-22 12:58:52,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:58:52,115 INFO L225 Difference]: With dead ends: 1286 [2020-11-22 12:58:52,116 INFO L226 Difference]: Without dead ends: 986 [2020-11-22 12:58:52,116 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:58:52,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2020-11-22 12:58:52,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2020-11-22 12:58:52,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2020-11-22 12:58:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2980 transitions. [2020-11-22 12:58:52,145 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2980 transitions. Word has length 18 [2020-11-22 12:58:52,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:58:52,146 INFO L481 AbstractCegarLoop]: Abstraction has 986 states and 2980 transitions. [2020-11-22 12:58:52,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 12:58:52,146 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2980 transitions. [2020-11-22 12:58:52,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-22 12:58:52,149 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:58:52,149 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:58:52,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-22 12:58:52,150 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:58:52,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:58:52,150 INFO L82 PathProgramCache]: Analyzing trace with hash 156009029, now seen corresponding path program 1 times [2020-11-22 12:58:52,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:58:52,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107313405] [2020-11-22 12:58:52,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:58:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:58:52,208 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:58:52,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107313405] [2020-11-22 12:58:52,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:58:52,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:58:52,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867158266] [2020-11-22 12:58:52,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 12:58:52,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:58:52,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 12:58:52,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 12:58:52,210 INFO L87 Difference]: Start difference. First operand 986 states and 2980 transitions. Second operand 4 states. [2020-11-22 12:58:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:58:52,250 INFO L93 Difference]: Finished difference Result 1449 states and 4230 transitions. [2020-11-22 12:58:52,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:58:52,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-11-22 12:58:52,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:58:52,253 INFO L225 Difference]: With dead ends: 1449 [2020-11-22 12:58:52,253 INFO L226 Difference]: Without dead ends: 1006 [2020-11-22 12:58:52,254 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:58:52,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2020-11-22 12:58:52,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 974. [2020-11-22 12:58:52,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2020-11-22 12:58:52,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 2794 transitions. [2020-11-22 12:58:52,281 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 2794 transitions. Word has length 20 [2020-11-22 12:58:52,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:58:52,282 INFO L481 AbstractCegarLoop]: Abstraction has 974 states and 2794 transitions. [2020-11-22 12:58:52,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 12:58:52,282 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 2794 transitions. [2020-11-22 12:58:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-22 12:58:52,285 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:58:52,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:58:52,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-22 12:58:52,285 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:58:52,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:58:52,286 INFO L82 PathProgramCache]: Analyzing trace with hash -513981036, now seen corresponding path program 1 times [2020-11-22 12:58:52,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:58:52,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119192401] [2020-11-22 12:58:52,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:58:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:58:52,358 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:58:52,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119192401] [2020-11-22 12:58:52,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:58:52,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 12:58:52,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410367565] [2020-11-22 12:58:52,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 12:58:52,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:58:52,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 12:58:52,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:58:52,360 INFO L87 Difference]: Start difference. First operand 974 states and 2794 transitions. Second operand 5 states. [2020-11-22 12:58:52,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:58:52,419 INFO L93 Difference]: Finished difference Result 1305 states and 3677 transitions. [2020-11-22 12:58:52,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:58:52,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-11-22 12:58:52,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:58:52,421 INFO L225 Difference]: With dead ends: 1305 [2020-11-22 12:58:52,422 INFO L226 Difference]: Without dead ends: 584 [2020-11-22 12:58:52,422 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:58:52,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-11-22 12:58:52,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2020-11-22 12:58:52,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-11-22 12:58:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1537 transitions. [2020-11-22 12:58:52,440 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1537 transitions. Word has length 21 [2020-11-22 12:58:52,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:58:52,440 INFO L481 AbstractCegarLoop]: Abstraction has 584 states and 1537 transitions. [2020-11-22 12:58:52,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 12:58:52,441 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1537 transitions. [2020-11-22 12:58:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-22 12:58:52,442 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:58:52,442 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:58:52,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-22 12:58:52,443 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:58:52,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:58:52,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1978467171, now seen corresponding path program 1 times [2020-11-22 12:58:52,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:58:52,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001195001] [2020-11-22 12:58:52,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:58:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:58:52,542 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:58:52,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001195001] [2020-11-22 12:58:52,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:58:52,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-22 12:58:52,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969921787] [2020-11-22 12:58:52,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 12:58:52,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:58:52,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 12:58:52,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:58:52,544 INFO L87 Difference]: Start difference. First operand 584 states and 1537 transitions. Second operand 6 states. [2020-11-22 12:58:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:58:52,614 INFO L93 Difference]: Finished difference Result 469 states and 1175 transitions. [2020-11-22 12:58:52,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-22 12:58:52,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-11-22 12:58:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:58:52,616 INFO L225 Difference]: With dead ends: 469 [2020-11-22 12:58:52,616 INFO L226 Difference]: Without dead ends: 400 [2020-11-22 12:58:52,617 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:58:52,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2020-11-22 12:58:52,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2020-11-22 12:58:52,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-11-22 12:58:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1007 transitions. [2020-11-22 12:58:52,627 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1007 transitions. Word has length 21 [2020-11-22 12:58:52,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:58:52,628 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 1007 transitions. [2020-11-22 12:58:52,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 12:58:52,628 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1007 transitions. [2020-11-22 12:58:52,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-22 12:58:52,632 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:58:52,633 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] [2020-11-22 12:58:52,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-22 12:58:52,633 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:58:52,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:58:52,634 INFO L82 PathProgramCache]: Analyzing trace with hash -506826856, now seen corresponding path program 1 times [2020-11-22 12:58:52,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:58:52,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726673425] [2020-11-22 12:58:52,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:58:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:58:52,757 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:58:52,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726673425] [2020-11-22 12:58:52,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:58:52,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-22 12:58:52,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032231634] [2020-11-22 12:58:52,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-22 12:58:52,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:58:52,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-22 12:58:52,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-22 12:58:52,759 INFO L87 Difference]: Start difference. First operand 400 states and 1007 transitions. Second operand 7 states. [2020-11-22 12:58:52,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:58:52,837 INFO L93 Difference]: Finished difference Result 369 states and 944 transitions. [2020-11-22 12:58:52,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-22 12:58:52,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-11-22 12:58:52,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:58:52,838 INFO L225 Difference]: With dead ends: 369 [2020-11-22 12:58:52,838 INFO L226 Difference]: Without dead ends: 220 [2020-11-22 12:58:52,838 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:58:52,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-11-22 12:58:52,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2020-11-22 12:58:52,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-11-22 12:58:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 541 transitions. [2020-11-22 12:58:52,843 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 541 transitions. Word has length 24 [2020-11-22 12:58:52,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:58:52,844 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 541 transitions. [2020-11-22 12:58:52,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-22 12:58:52,844 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 541 transitions. [2020-11-22 12:58:52,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-22 12:58:52,845 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:58:52,848 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, 1] [2020-11-22 12:58:52,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-22 12:58:52,849 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:58:52,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:58:52,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1954672749, now seen corresponding path program 1 times [2020-11-22 12:58:52,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:58:52,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920437053] [2020-11-22 12:58:52,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:58:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:58:52,985 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:58:52,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920437053] [2020-11-22 12:58:52,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:58:52,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-22 12:58:52,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346000857] [2020-11-22 12:58:52,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-22 12:58:52,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:58:52,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-22 12:58:52,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-22 12:58:52,986 INFO L87 Difference]: Start difference. First operand 220 states and 541 transitions. Second operand 7 states. [2020-11-22 12:58:53,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:58:53,062 INFO L93 Difference]: Finished difference Result 377 states and 949 transitions. [2020-11-22 12:58:53,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-22 12:58:53,063 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-11-22 12:58:53,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:58:53,064 INFO L225 Difference]: With dead ends: 377 [2020-11-22 12:58:53,064 INFO L226 Difference]: Without dead ends: 181 [2020-11-22 12:58:53,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-22 12:58:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-11-22 12:58:53,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2020-11-22 12:58:53,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-11-22 12:58:53,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 451 transitions. [2020-11-22 12:58:53,069 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 451 transitions. Word has length 27 [2020-11-22 12:58:53,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:58:53,069 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 451 transitions. [2020-11-22 12:58:53,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-22 12:58:53,069 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 451 transitions. [2020-11-22 12:58:53,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-22 12:58:53,070 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:58:53,070 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, 1] [2020-11-22 12:58:53,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-22 12:58:53,071 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:58:53,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:58:53,071 INFO L82 PathProgramCache]: Analyzing trace with hash 509129051, now seen corresponding path program 2 times [2020-11-22 12:58:53,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:58:53,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801618801] [2020-11-22 12:58:53,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:58:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:58:53,336 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:58:53,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801618801] [2020-11-22 12:58:53,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:58:53,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-22 12:58:53,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120832151] [2020-11-22 12:58:53,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-22 12:58:53,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:58:53,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-22 12:58:53,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-11-22 12:58:53,338 INFO L87 Difference]: Start difference. First operand 181 states and 451 transitions. Second operand 10 states. [2020-11-22 12:58:53,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:58:53,501 INFO L93 Difference]: Finished difference Result 320 states and 780 transitions. [2020-11-22 12:58:53,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-22 12:58:53,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-11-22 12:58:53,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:58:53,502 INFO L225 Difference]: With dead ends: 320 [2020-11-22 12:58:53,502 INFO L226 Difference]: Without dead ends: 229 [2020-11-22 12:58:53,502 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-11-22 12:58:53,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-11-22 12:58:53,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 181. [2020-11-22 12:58:53,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-11-22 12:58:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 429 transitions. [2020-11-22 12:58:53,507 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 429 transitions. Word has length 27 [2020-11-22 12:58:53,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:58:53,507 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 429 transitions. [2020-11-22 12:58:53,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-22 12:58:53,508 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 429 transitions. [2020-11-22 12:58:53,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-22 12:58:53,508 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:58:53,508 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, 1] [2020-11-22 12:58:53,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-22 12:58:53,509 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:58:53,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:58:53,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1463311731, now seen corresponding path program 3 times [2020-11-22 12:58:53,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:58:53,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281576291] [2020-11-22 12:58:53,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:58:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:58:53,586 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:58:53,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281576291] [2020-11-22 12:58:53,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:58:53,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 12:58:53,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913727704] [2020-11-22 12:58:53,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 12:58:53,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:58:53,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 12:58:53,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:58:53,588 INFO L87 Difference]: Start difference. First operand 181 states and 429 transitions. Second operand 6 states. [2020-11-22 12:58:53,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:58:53,633 INFO L93 Difference]: Finished difference Result 250 states and 593 transitions. [2020-11-22 12:58:53,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:58:53,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-11-22 12:58:53,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:58:53,634 INFO L225 Difference]: With dead ends: 250 [2020-11-22 12:58:53,634 INFO L226 Difference]: Without dead ends: 93 [2020-11-22 12:58:53,634 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-22 12:58:53,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-11-22 12:58:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-11-22 12:58:53,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-11-22 12:58:53,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 199 transitions. [2020-11-22 12:58:53,636 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 199 transitions. Word has length 27 [2020-11-22 12:58:53,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:58:53,636 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 199 transitions. [2020-11-22 12:58:53,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 12:58:53,637 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 199 transitions. [2020-11-22 12:58:53,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-22 12:58:53,637 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:58:53,637 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, 1] [2020-11-22 12:58:53,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-22 12:58:53,637 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:58:53,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:58:53,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1748049593, now seen corresponding path program 4 times [2020-11-22 12:58:53,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:58:53,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615243024] [2020-11-22 12:58:53,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:58:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:58:53,871 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:58:53,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615243024] [2020-11-22 12:58:53,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:58:53,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-22 12:58:53,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469465414] [2020-11-22 12:58:53,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-22 12:58:53,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:58:53,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-22 12:58:53,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-22 12:58:53,874 INFO L87 Difference]: Start difference. First operand 93 states and 199 transitions. Second operand 9 states. [2020-11-22 12:58:53,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:58:53,980 INFO L93 Difference]: Finished difference Result 120 states and 254 transitions. [2020-11-22 12:58:53,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-22 12:58:53,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-11-22 12:58:53,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:58:53,981 INFO L225 Difference]: With dead ends: 120 [2020-11-22 12:58:53,981 INFO L226 Difference]: Without dead ends: 65 [2020-11-22 12:58:53,981 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-11-22 12:58:53,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-22 12:58:53,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-11-22 12:58:53,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-22 12:58:53,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2020-11-22 12:58:53,983 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 27 [2020-11-22 12:58:53,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:58:53,983 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2020-11-22 12:58:53,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-22 12:58:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2020-11-22 12:58:53,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-22 12:58:53,984 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:58:53,984 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, 1] [2020-11-22 12:58:53,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-22 12:58:53,984 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:58:53,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:58:53,985 INFO L82 PathProgramCache]: Analyzing trace with hash -370388729, now seen corresponding path program 5 times [2020-11-22 12:58:53,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:58:53,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403282992] [2020-11-22 12:58:53,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:58:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-22 12:58:54,021 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-22 12:58:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-22 12:58:54,060 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-22 12:58:54,114 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-22 12:58:54,114 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-22 12:58:54,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-22 12:58:54,154 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:58:54,155 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,155 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:58:54,155 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [801] [2020-11-22 12:58:54,158 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:58:54,158 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,158 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:58:54,158 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,158 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:58:54,158 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,158 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:58:54,159 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,159 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:58:54,159 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,159 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:58:54,159 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,159 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:58:54,159 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,159 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:58:54,160 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,160 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:58:54,160 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,160 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:58:54,160 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,160 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:58:54,161 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,161 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:58:54,161 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,161 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:58:54,161 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,162 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:58:54,162 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,168 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:58:54,168 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,168 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:58:54,168 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,169 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:58:54,169 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,169 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:58:54,169 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,169 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:58:54,169 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,169 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:58:54,169 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,169 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:58:54,169 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,170 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:58:54,170 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,170 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:58:54,170 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,170 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:58:54,170 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,170 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:58:54,170 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,170 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:58:54,170 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,170 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:58:54,171 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:58:54 BasicIcfg [2020-11-22 12:58:54,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-22 12:58:54,248 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-22 12:58:54,248 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-22 12:58:54,248 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-22 12:58:54,249 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:58:39" (3/4) ... [2020-11-22 12:58:54,250 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-22 12:58:54,265 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:58:54,265 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,265 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:58:54,265 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [801] [2020-11-22 12:58:54,267 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:58:54,267 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,267 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:58:54,267 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,267 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:58:54,267 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,267 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:58:54,267 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,267 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:58:54,268 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,268 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:58:54,268 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,268 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:58:54,268 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,268 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:58:54,268 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,268 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:58:54,269 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,269 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:58:54,269 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,269 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:58:54,269 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,270 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:58:54,270 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,270 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:58:54,270 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,270 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:58:54,270 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,270 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:58:54,270 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,270 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:58:54,271 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,271 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:58:54,271 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,271 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:58:54,271 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,271 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:58:54,271 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,271 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:58:54,271 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,272 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:58:54,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,272 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:58:54,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,272 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:58:54,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,272 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:58:54,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,273 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:58:54,273 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,273 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:58:54,273 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,273 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:58:54,273 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:58:54,426 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8e9b6ae2-8c3d-4327-8646-0f949b84139c/bin/utaipan/witness.graphml [2020-11-22 12:58:54,426 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-22 12:58:54,428 INFO L168 Benchmark]: Toolchain (without parser) took 17993.84 ms. Allocated memory was 83.9 MB in the beginning and 398.5 MB in the end (delta: 314.6 MB). Free memory was 51.3 MB in the beginning and 288.7 MB in the end (delta: -237.4 MB). Peak memory consumption was 76.5 MB. Max. memory is 16.1 GB. [2020-11-22 12:58:54,428 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 83.9 MB. Free memory was 43.1 MB in the beginning and 43.1 MB in the end (delta: 35.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-22 12:58:54,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 654.45 ms. Allocated memory is still 83.9 MB. Free memory was 51.1 MB in the beginning and 35.9 MB in the end (delta: 15.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-22 12:58:54,431 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.32 ms. Allocated memory is still 83.9 MB. Free memory was 35.9 MB in the beginning and 32.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-22 12:58:54,431 INFO L168 Benchmark]: Boogie Preprocessor took 50.65 ms. Allocated memory was 83.9 MB in the beginning and 109.1 MB in the end (delta: 25.2 MB). Free memory was 32.8 MB in the beginning and 85.8 MB in the end (delta: -52.9 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. [2020-11-22 12:58:54,431 INFO L168 Benchmark]: RCFGBuilder took 2369.08 ms. Allocated memory was 109.1 MB in the beginning and 134.2 MB in the end (delta: 25.2 MB). Free memory was 85.7 MB in the beginning and 49.3 MB in the end (delta: 36.4 MB). Peak memory consumption was 61.7 MB. Max. memory is 16.1 GB. [2020-11-22 12:58:54,432 INFO L168 Benchmark]: TraceAbstraction took 14639.42 ms. Allocated memory was 134.2 MB in the beginning and 398.5 MB in the end (delta: 264.2 MB). Free memory was 49.3 MB in the beginning and 309.6 MB in the end (delta: -260.4 MB). Peak memory consumption was 226.4 MB. Max. memory is 16.1 GB. [2020-11-22 12:58:54,432 INFO L168 Benchmark]: Witness Printer took 178.61 ms. Allocated memory is still 398.5 MB. Free memory was 309.6 MB in the beginning and 288.7 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-22 12:58:54,434 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.25 ms. Allocated memory is still 83.9 MB. Free memory was 43.1 MB in the beginning and 43.1 MB in the end (delta: 35.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 654.45 ms. Allocated memory is still 83.9 MB. Free memory was 51.1 MB in the beginning and 35.9 MB in the end (delta: 15.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 95.32 ms. Allocated memory is still 83.9 MB. Free memory was 35.9 MB in the beginning and 32.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 50.65 ms. Allocated memory was 83.9 MB in the beginning and 109.1 MB in the end (delta: 25.2 MB). Free memory was 32.8 MB in the beginning and 85.8 MB in the end (delta: -52.9 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2369.08 ms. Allocated memory was 109.1 MB in the beginning and 134.2 MB in the end (delta: 25.2 MB). Free memory was 85.7 MB in the beginning and 49.3 MB in the end (delta: 36.4 MB). Peak memory consumption was 61.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14639.42 ms. Allocated memory was 134.2 MB in the beginning and 398.5 MB in the end (delta: 264.2 MB). Free memory was 49.3 MB in the beginning and 309.6 MB in the end (delta: -260.4 MB). Peak memory consumption was 226.4 MB. Max. memory is 16.1 GB. * Witness Printer took 178.61 ms. Allocated memory is still 398.5 MB. Free memory was 309.6 MB in the beginning and 288.7 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1888 VarBasedMoverChecksPositive, 70 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 47 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 238 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.6s, 131 PlacesBefore, 46 PlacesAfterwards, 121 TransitionsBefore, 34 TransitionsAfterwards, 2830 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 103 TotalNumberOfCompositions, 7226 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_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1237; [L847] FCALL, FORK 0 pthread_create(&t1237, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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] [L848] 0 pthread_t t1238; [L849] FCALL, FORK 0 pthread_create(&t1238, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L850] 0 pthread_t t1239; [L851] FCALL, FORK 0 pthread_create(&t1239, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L852] 0 pthread_t t1240; [L853] FCALL, FORK 0 pthread_create(&t1240, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L18] COND TRUE 4 !expression [L17] COND FALSE 4 !(0) [L17] 4 __assert_fail ("0", "mix046_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L782] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L785] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L824] 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) [L824] 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) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 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 [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 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 [L788] 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) [L788] 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) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 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 [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 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 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] 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) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] 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) [L859] 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) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 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 [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 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_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 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 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 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) [L870] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L870] 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) [L870] 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) [L871] 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)) [L871] 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)) [L872] 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)) [L872] 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)) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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)) [L875] 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)) [L875] 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)) [L876] 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)) [L876] 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) [L876] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L876] 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) [L876] 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)) [L876] 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)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix046_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, 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, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.3s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 768 SDtfs, 980 SDslu, 1790 SDs, 0 SdLazy, 568 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3562occurred 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.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 1184 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 385 NumberOfCodeBlocks, 385 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 339 ConstructedInterpolants, 0 QuantifiedInterpolants, 50091 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...