./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe031_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_e66f78c7-0857-4a73-ab00-a4dc9c493fcf/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_e66f78c7-0857-4a73-ab00-a4dc9c493fcf/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e66f78c7-0857-4a73-ab00-a4dc9c493fcf/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e66f78c7-0857-4a73-ab00-a4dc9c493fcf/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e66f78c7-0857-4a73-ab00-a4dc9c493fcf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e66f78c7-0857-4a73-ab00-a4dc9c493fcf/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 2d0efb2b7db857c130817c46f142aefdb6cc0e00 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:07:37,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-22 13:07:37,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-22 13:07:37,136 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-22 13:07:37,136 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-22 13:07:37,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-22 13:07:37,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-22 13:07:37,141 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-22 13:07:37,143 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-22 13:07:37,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-22 13:07:37,145 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-22 13:07:37,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-22 13:07:37,147 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-22 13:07:37,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-22 13:07:37,153 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-22 13:07:37,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-22 13:07:37,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-22 13:07:37,162 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-22 13:07:37,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-22 13:07:37,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-22 13:07:37,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-22 13:07:37,182 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-22 13:07:37,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-22 13:07:37,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-22 13:07:37,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-22 13:07:37,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-22 13:07:37,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-22 13:07:37,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-22 13:07:37,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-22 13:07:37,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-22 13:07:37,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-22 13:07:37,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-22 13:07:37,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-22 13:07:37,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-22 13:07:37,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-22 13:07:37,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-22 13:07:37,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-22 13:07:37,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-22 13:07:37,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-22 13:07:37,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-22 13:07:37,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-22 13:07:37,206 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e66f78c7-0857-4a73-ab00-a4dc9c493fcf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-22 13:07:37,240 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-22 13:07:37,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-22 13:07:37,241 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-22 13:07:37,241 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-22 13:07:37,241 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-22 13:07:37,241 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-22 13:07:37,242 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-22 13:07:37,242 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-22 13:07:37,242 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-22 13:07:37,242 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-22 13:07:37,242 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-22 13:07:37,243 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-22 13:07:37,243 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-22 13:07:37,243 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-22 13:07:37,243 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-22 13:07:37,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-22 13:07:37,244 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-22 13:07:37,244 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-22 13:07:37,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-22 13:07:37,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-22 13:07:37,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-22 13:07:37,245 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-22 13:07:37,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-22 13:07:37,246 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-22 13:07:37,246 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-22 13:07:37,246 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-22 13:07:37,246 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-22 13:07:37,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-22 13:07:37,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-22 13:07:37,247 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-22 13:07:37,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-22 13:07:37,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-22 13:07:37,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-22 13:07:37,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-22 13:07:37,248 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-22 13:07:37,249 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-22 13:07:37,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-22 13:07:37,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-22 13:07:37,249 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-22 13:07:37,249 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-22 13:07:37,250 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_e66f78c7-0857-4a73-ab00-a4dc9c493fcf/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_e66f78c7-0857-4a73-ab00-a4dc9c493fcf/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 -> 2d0efb2b7db857c130817c46f142aefdb6cc0e00 [2020-11-22 13:07:37,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-22 13:07:37,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-22 13:07:37,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-22 13:07:37,538 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-22 13:07:37,539 INFO L275 PluginConnector]: CDTParser initialized [2020-11-22 13:07:37,540 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e66f78c7-0857-4a73-ab00-a4dc9c493fcf/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe031_rmo.opt.i [2020-11-22 13:07:37,599 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e66f78c7-0857-4a73-ab00-a4dc9c493fcf/bin/utaipan/data/366eed86f/edf1a1b2b26147188d172dbe435334d8/FLAG411c6f810 [2020-11-22 13:07:38,173 INFO L306 CDTParser]: Found 1 translation units. [2020-11-22 13:07:38,173 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e66f78c7-0857-4a73-ab00-a4dc9c493fcf/sv-benchmarks/c/pthread-wmm/safe031_rmo.opt.i [2020-11-22 13:07:38,198 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e66f78c7-0857-4a73-ab00-a4dc9c493fcf/bin/utaipan/data/366eed86f/edf1a1b2b26147188d172dbe435334d8/FLAG411c6f810 [2020-11-22 13:07:38,427 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e66f78c7-0857-4a73-ab00-a4dc9c493fcf/bin/utaipan/data/366eed86f/edf1a1b2b26147188d172dbe435334d8 [2020-11-22 13:07:38,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-22 13:07:38,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-22 13:07:38,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-22 13:07:38,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-22 13:07:38,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-22 13:07:38,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:07:38" (1/1) ... [2020-11-22 13:07:38,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d7bf864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:38, skipping insertion in model container [2020-11-22 13:07:38,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:07:38" (1/1) ... [2020-11-22 13:07:38,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-22 13:07:38,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-22 13:07:39,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-22 13:07:39,041 INFO L203 MainTranslator]: Completed pre-run [2020-11-22 13:07:39,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-22 13:07:39,230 INFO L208 MainTranslator]: Completed translation [2020-11-22 13:07:39,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:39 WrapperNode [2020-11-22 13:07:39,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-22 13:07:39,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-22 13:07:39,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-22 13:07:39,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-22 13:07:39,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:39" (1/1) ... [2020-11-22 13:07:39,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:39" (1/1) ... [2020-11-22 13:07:39,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-22 13:07:39,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-22 13:07:39,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-22 13:07:39,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-22 13:07:39,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:39" (1/1) ... [2020-11-22 13:07:39,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:39" (1/1) ... [2020-11-22 13:07:39,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:39" (1/1) ... [2020-11-22 13:07:39,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:39" (1/1) ... [2020-11-22 13:07:39,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:39" (1/1) ... [2020-11-22 13:07:39,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:39" (1/1) ... [2020-11-22 13:07:39,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:39" (1/1) ... [2020-11-22 13:07:39,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-22 13:07:39,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-22 13:07:39,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-22 13:07:39,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-22 13:07:39,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e66f78c7-0857-4a73-ab00-a4dc9c493fcf/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 13:07:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-22 13:07:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-22 13:07:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-22 13:07:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-22 13:07:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-22 13:07:39,476 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-22 13:07:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-22 13:07:39,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-22 13:07:39,477 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-22 13:07:39,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-22 13:07:39,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-22 13:07:39,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-22 13:07:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-22 13:07:39,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-22 13:07:39,479 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 13:07:41,576 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-22 13:07:41,577 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-22 13:07:41,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:07:41 BoogieIcfgContainer [2020-11-22 13:07:41,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-22 13:07:41,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-22 13:07:41,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-22 13:07:41,584 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-22 13:07:41,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:07:38" (1/3) ... [2020-11-22 13:07:41,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb389a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:07:41, skipping insertion in model container [2020-11-22 13:07:41,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:39" (2/3) ... [2020-11-22 13:07:41,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb389a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:07:41, skipping insertion in model container [2020-11-22 13:07:41,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:07:41" (3/3) ... [2020-11-22 13:07:41,587 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_rmo.opt.i [2020-11-22 13:07:41,597 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-22 13:07:41,597 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-22 13:07:41,601 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-22 13:07:41,602 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-22 13:07:41,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,649 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,649 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,651 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,651 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,657 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,658 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,659 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,660 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,665 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,665 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,666 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,677 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,677 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,677 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,677 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,681 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,681 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:07:41,685 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-22 13:07:41,696 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-22 13:07:41,725 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-22 13:07:41,725 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-22 13:07:41,725 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-22 13:07:41,725 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-22 13:07:41,725 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-22 13:07:41,726 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-22 13:07:41,726 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-22 13:07:41,726 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-22 13:07:41,743 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-22 13:07:41,745 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 100 transitions, 215 flow [2020-11-22 13:07:41,750 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 100 transitions, 215 flow [2020-11-22 13:07:41,752 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 100 transitions, 215 flow [2020-11-22 13:07:41,810 INFO L129 PetriNetUnfolder]: 3/97 cut-off events. [2020-11-22 13:07:41,810 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-22 13:07:41,814 INFO L80 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-11-22 13:07:41,819 INFO L116 LiptonReduction]: Number of co-enabled transitions 1746 [2020-11-22 13:07:41,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:07:41,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:41,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:07:41,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:41,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:07:41,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:41,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:07:41,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:07:42,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:07:42,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:07:42,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:07:42,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:07:42,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:07:42,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:07:42,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:07:42,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:07:42,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:07:42,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:07:42,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:07:42,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:07:42,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:07:42,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:07:42,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:07:42,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-22 13:07:42,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:07:42,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:07:42,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:07:42,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-11-22 13:07:42,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:07:42,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:07:42,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:07:42,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-11-22 13:07:42,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:07:42,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:07:42,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-22 13:07:42,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-22 13:07:42,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:07:42,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:07:42,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:07:42,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:07:42,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:07:42,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:07:42,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:07:42,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:07:42,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:07:42,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-22 13:07:42,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:07:42,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:07:42,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:07:42,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:07:42,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:07:42,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:07:42,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:07:42,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:07:42,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:07:42,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:07:42,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:07:42,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:07:42,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:07:42,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:42,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:07:42,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:43,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:07:43,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:43,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:07:43,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:43,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:07:43,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:43,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:07:43,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:43,325 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-11-22 13:07:43,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:07:43,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:43,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:07:43,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:43,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:07:43,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:07:43,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-11-22 13:07:43,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:07:43,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:07:43,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:07:43,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:07:43,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:43,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:07:43,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:43,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:07:43,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:07:43,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:07:43,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:07:43,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:07:43,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:07:43,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:07:43,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:43,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:07:43,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:43,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:07:43,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:43,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:07:43,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:43,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:07:43,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:43,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:07:43,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-22 13:07:43,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:07:43,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:43,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:07:43,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:43,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:07:43,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:43,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:07:43,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:43,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:07:43,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:43,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 13:07:43,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:07:44,435 WARN L193 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-22 13:07:44,556 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-22 13:07:44,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-11-22 13:07:44,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:44,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:07:44,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:44,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:07:44,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:44,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:07:44,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:44,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:07:44,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:44,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-22 13:07:44,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:44,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-22 13:07:44,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:44,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 13:07:44,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:07:44,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:07:44,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:07:44,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:07:44,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:07:44,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:07:44,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:44,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:07:44,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:44,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:07:44,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:07:44,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:07:44,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:07:44,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:07:44,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:07:44,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:07:44,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:07:45,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:07:45,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:07:45,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:07:45,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:07:45,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:07:45,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:07:45,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:07:45,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:07:45,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:07:45,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:07:45,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:07:45,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:07:45,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:07:45,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:45,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:07:45,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:45,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:07:45,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:45,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:07:45,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:45,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:07:45,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:45,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:07:45,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:46,285 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-11-22 13:07:46,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-11-22 13:07:46,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:46,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:07:46,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:07:47,102 WARN L193 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-11-22 13:07:48,220 WARN L193 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2020-11-22 13:07:48,491 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-22 13:07:49,014 WARN L193 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2020-11-22 13:07:49,238 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-22 13:07:50,292 WARN L193 SmtUtils]: Spent 806.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-11-22 13:07:50,568 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-11-22 13:07:50,921 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2020-11-22 13:07:51,369 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-11-22 13:07:51,528 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-22 13:07:51,549 INFO L131 LiptonReduction]: Checked pairs total: 4721 [2020-11-22 13:07:51,549 INFO L133 LiptonReduction]: Total number of compositions: 93 [2020-11-22 13:07:51,559 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow [2020-11-22 13:07:51,615 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-11-22 13:07:51,617 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-11-22 13:07:51,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-22 13:07:51,622 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:07:51,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:07:51,623 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:07:51,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:07:51,631 INFO L82 PathProgramCache]: Analyzing trace with hash 117480453, now seen corresponding path program 1 times [2020-11-22 13:07:51,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:07:51,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460856525] [2020-11-22 13:07:51,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:07:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:07:51,914 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 13:07:51,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460856525] [2020-11-22 13:07:51,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:07:51,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-22 13:07:51,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436435073] [2020-11-22 13:07:51,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 13:07:51,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:07:51,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 13:07:51,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:07:51,935 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-11-22 13:07:52,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:07:52,071 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-11-22 13:07:52,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 13:07:52,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-22 13:07:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:07:52,099 INFO L225 Difference]: With dead ends: 550 [2020-11-22 13:07:52,100 INFO L226 Difference]: Without dead ends: 450 [2020-11-22 13:07:52,101 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 13:07:52,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-11-22 13:07:52,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-11-22 13:07:52,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-11-22 13:07:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-11-22 13:07:52,190 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-11-22 13:07:52,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:07:52,191 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-11-22 13:07:52,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 13:07:52,192 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-11-22 13:07:52,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-22 13:07:52,193 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:07:52,193 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:07:52,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-22 13:07:52,193 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:07:52,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:07:52,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1229600893, now seen corresponding path program 1 times [2020-11-22 13:07:52,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:07:52,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012077549] [2020-11-22 13:07:52,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:07:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:07:52,276 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 13:07:52,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012077549] [2020-11-22 13:07:52,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:07:52,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-22 13:07:52,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233980992] [2020-11-22 13:07:52,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 13:07:52,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:07:52,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 13:07:52,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:07:52,278 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-11-22 13:07:52,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:07:52,294 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-11-22 13:07:52,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 13:07:52,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-22 13:07:52,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:07:52,299 INFO L225 Difference]: With dead ends: 440 [2020-11-22 13:07:52,299 INFO L226 Difference]: Without dead ends: 440 [2020-11-22 13:07:52,299 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 13:07:52,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-11-22 13:07:52,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-11-22 13:07:52,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-11-22 13:07:52,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-11-22 13:07:52,319 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2020-11-22 13:07:52,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:07:52,319 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-11-22 13:07:52,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 13:07:52,319 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-11-22 13:07:52,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-22 13:07:52,321 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:07:52,321 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:07:52,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-22 13:07:52,321 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:07:52,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:07:52,322 INFO L82 PathProgramCache]: Analyzing trace with hash -537078871, now seen corresponding path program 1 times [2020-11-22 13:07:52,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:07:52,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638880873] [2020-11-22 13:07:52,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:07:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:07:52,450 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 13:07:52,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638880873] [2020-11-22 13:07:52,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:07:52,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-22 13:07:52,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110901271] [2020-11-22 13:07:52,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 13:07:52,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:07:52,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 13:07:52,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-22 13:07:52,452 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 4 states. [2020-11-22 13:07:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:07:52,523 INFO L93 Difference]: Finished difference Result 434 states and 1298 transitions. [2020-11-22 13:07:52,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 13:07:52,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-22 13:07:52,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:07:52,528 INFO L225 Difference]: With dead ends: 434 [2020-11-22 13:07:52,528 INFO L226 Difference]: Without dead ends: 434 [2020-11-22 13:07:52,528 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-22 13:07:52,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-11-22 13:07:52,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-11-22 13:07:52,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-11-22 13:07:52,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1298 transitions. [2020-11-22 13:07:52,542 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1298 transitions. Word has length 10 [2020-11-22 13:07:52,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:07:52,543 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1298 transitions. [2020-11-22 13:07:52,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 13:07:52,543 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1298 transitions. [2020-11-22 13:07:52,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-22 13:07:52,545 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:07:52,545 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:07:52,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-22 13:07:52,545 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:07:52,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:07:52,546 INFO L82 PathProgramCache]: Analyzing trace with hash 530435755, now seen corresponding path program 1 times [2020-11-22 13:07:52,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:07:52,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383571213] [2020-11-22 13:07:52,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:07:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:07:52,650 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 13:07:52,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383571213] [2020-11-22 13:07:52,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:07:52,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-22 13:07:52,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765336098] [2020-11-22 13:07:52,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 13:07:52,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:07:52,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 13:07:52,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:07:52,652 INFO L87 Difference]: Start difference. First operand 434 states and 1298 transitions. Second operand 3 states. [2020-11-22 13:07:52,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:07:52,676 INFO L93 Difference]: Finished difference Result 599 states and 1720 transitions. [2020-11-22 13:07:52,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 13:07:52,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-22 13:07:52,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:07:52,680 INFO L225 Difference]: With dead ends: 599 [2020-11-22 13:07:52,680 INFO L226 Difference]: Without dead ends: 464 [2020-11-22 13:07:52,680 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:07:52,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-11-22 13:07:52,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 419. [2020-11-22 13:07:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2020-11-22 13:07:52,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 1201 transitions. [2020-11-22 13:07:52,696 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 1201 transitions. Word has length 11 [2020-11-22 13:07:52,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:07:52,697 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 1201 transitions. [2020-11-22 13:07:52,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 13:07:52,697 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 1201 transitions. [2020-11-22 13:07:52,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-22 13:07:52,698 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:07:52,698 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:07:52,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-22 13:07:52,699 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:07:52,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:07:52,699 INFO L82 PathProgramCache]: Analyzing trace with hash 530436747, now seen corresponding path program 1 times [2020-11-22 13:07:52,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:07:52,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238549059] [2020-11-22 13:07:52,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:07:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:07:52,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 13:07:52,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238549059] [2020-11-22 13:07:52,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:07:52,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 13:07:52,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197079717] [2020-11-22 13:07:52,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 13:07:52,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:07:52,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 13:07:52,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-22 13:07:52,858 INFO L87 Difference]: Start difference. First operand 419 states and 1201 transitions. Second operand 5 states. [2020-11-22 13:07:52,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:07:52,924 INFO L93 Difference]: Finished difference Result 407 states and 1157 transitions. [2020-11-22 13:07:52,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-22 13:07:52,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-11-22 13:07:52,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:07:52,932 INFO L225 Difference]: With dead ends: 407 [2020-11-22 13:07:52,932 INFO L226 Difference]: Without dead ends: 407 [2020-11-22 13:07:52,932 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-22 13:07:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2020-11-22 13:07:52,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2020-11-22 13:07:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-11-22 13:07:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1157 transitions. [2020-11-22 13:07:52,946 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1157 transitions. Word has length 11 [2020-11-22 13:07:52,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:07:52,947 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 1157 transitions. [2020-11-22 13:07:52,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 13:07:52,947 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1157 transitions. [2020-11-22 13:07:52,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-22 13:07:52,948 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:07:52,948 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:07:52,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-22 13:07:52,949 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:07:52,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:07:52,949 INFO L82 PathProgramCache]: Analyzing trace with hash -769299944, now seen corresponding path program 1 times [2020-11-22 13:07:52,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:07:52,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513686096] [2020-11-22 13:07:52,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:07:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:07:53,030 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 13:07:53,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513686096] [2020-11-22 13:07:53,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:07:53,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 13:07:53,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959033223] [2020-11-22 13:07:53,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 13:07:53,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:07:53,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 13:07:53,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-22 13:07:53,031 INFO L87 Difference]: Start difference. First operand 407 states and 1157 transitions. Second operand 5 states. [2020-11-22 13:07:53,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:07:53,112 INFO L93 Difference]: Finished difference Result 402 states and 1138 transitions. [2020-11-22 13:07:53,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-22 13:07:53,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-22 13:07:53,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:07:53,116 INFO L225 Difference]: With dead ends: 402 [2020-11-22 13:07:53,116 INFO L226 Difference]: Without dead ends: 402 [2020-11-22 13:07:53,117 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-22 13:07:53,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2020-11-22 13:07:53,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 398. [2020-11-22 13:07:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-11-22 13:07:53,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1127 transitions. [2020-11-22 13:07:53,131 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1127 transitions. Word has length 12 [2020-11-22 13:07:53,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:07:53,131 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 1127 transitions. [2020-11-22 13:07:53,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 13:07:53,131 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1127 transitions. [2020-11-22 13:07:53,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-22 13:07:53,133 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:07:53,133 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:07:53,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-22 13:07:53,133 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:07:53,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:07:53,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1921518076, now seen corresponding path program 1 times [2020-11-22 13:07:53,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:07:53,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367541638] [2020-11-22 13:07:53,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:07:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:07:53,268 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 13:07:53,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367541638] [2020-11-22 13:07:53,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:07:53,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 13:07:53,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124402493] [2020-11-22 13:07:53,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 13:07:53,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:07:53,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 13:07:53,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 13:07:53,269 INFO L87 Difference]: Start difference. First operand 398 states and 1127 transitions. Second operand 6 states. [2020-11-22 13:07:53,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:07:53,401 INFO L93 Difference]: Finished difference Result 392 states and 1105 transitions. [2020-11-22 13:07:53,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 13:07:53,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-11-22 13:07:53,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:07:53,406 INFO L225 Difference]: With dead ends: 392 [2020-11-22 13:07:53,406 INFO L226 Difference]: Without dead ends: 392 [2020-11-22 13:07:53,406 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-22 13:07:53,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2020-11-22 13:07:53,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2020-11-22 13:07:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-11-22 13:07:53,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1105 transitions. [2020-11-22 13:07:53,420 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1105 transitions. Word has length 13 [2020-11-22 13:07:53,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:07:53,421 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 1105 transitions. [2020-11-22 13:07:53,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 13:07:53,421 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1105 transitions. [2020-11-22 13:07:53,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-22 13:07:53,422 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:07:53,422 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:07:53,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-22 13:07:53,423 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:07:53,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:07:53,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1352377110, now seen corresponding path program 1 times [2020-11-22 13:07:53,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:07:53,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157239265] [2020-11-22 13:07:53,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:07:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:07:53,526 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 13:07:53,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157239265] [2020-11-22 13:07:53,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:07:53,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 13:07:53,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161393756] [2020-11-22 13:07:53,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 13:07:53,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:07:53,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 13:07:53,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 13:07:53,528 INFO L87 Difference]: Start difference. First operand 392 states and 1105 transitions. Second operand 4 states. [2020-11-22 13:07:53,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:07:53,566 INFO L93 Difference]: Finished difference Result 384 states and 957 transitions. [2020-11-22 13:07:53,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 13:07:53,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-22 13:07:53,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:07:53,569 INFO L225 Difference]: With dead ends: 384 [2020-11-22 13:07:53,569 INFO L226 Difference]: Without dead ends: 284 [2020-11-22 13:07:53,570 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 13:07:53,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-11-22 13:07:53,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2020-11-22 13:07:53,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2020-11-22 13:07:53,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 689 transitions. [2020-11-22 13:07:53,580 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 689 transitions. Word has length 13 [2020-11-22 13:07:53,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:07:53,580 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 689 transitions. [2020-11-22 13:07:53,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 13:07:53,580 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 689 transitions. [2020-11-22 13:07:53,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-22 13:07:53,581 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:07:53,581 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:07:53,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-22 13:07:53,581 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:07:53,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:07:53,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1882145435, now seen corresponding path program 1 times [2020-11-22 13:07:53,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:07:53,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473345102] [2020-11-22 13:07:53,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:07:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:07:53,712 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 13:07:53,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473345102] [2020-11-22 13:07:53,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:07:53,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 13:07:53,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986574590] [2020-11-22 13:07:53,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 13:07:53,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:07:53,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 13:07:53,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-22 13:07:53,714 INFO L87 Difference]: Start difference. First operand 284 states and 689 transitions. Second operand 5 states. [2020-11-22 13:07:53,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:07:53,786 INFO L93 Difference]: Finished difference Result 236 states and 525 transitions. [2020-11-22 13:07:53,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 13:07:53,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-22 13:07:53,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:07:53,789 INFO L225 Difference]: With dead ends: 236 [2020-11-22 13:07:53,789 INFO L226 Difference]: Without dead ends: 184 [2020-11-22 13:07:53,790 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 13:07:53,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-11-22 13:07:53,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2020-11-22 13:07:53,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-11-22 13:07:53,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 401 transitions. [2020-11-22 13:07:53,795 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 401 transitions. Word has length 14 [2020-11-22 13:07:53,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:07:53,796 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 401 transitions. [2020-11-22 13:07:53,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 13:07:53,796 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 401 transitions. [2020-11-22 13:07:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-22 13:07:53,797 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:07:53,797 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:07:53,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-22 13:07:53,798 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:07:53,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:07:53,798 INFO L82 PathProgramCache]: Analyzing trace with hash 573655817, now seen corresponding path program 1 times [2020-11-22 13:07:53,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:07:53,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108236446] [2020-11-22 13:07:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:07:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:07:53,984 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 13:07:53,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108236446] [2020-11-22 13:07:53,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:07:53,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-22 13:07:53,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981103595] [2020-11-22 13:07:53,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 13:07:53,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:07:53,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 13:07:53,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 13:07:53,986 INFO L87 Difference]: Start difference. First operand 184 states and 401 transitions. Second operand 6 states. [2020-11-22 13:07:54,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:07:54,056 INFO L93 Difference]: Finished difference Result 165 states and 362 transitions. [2020-11-22 13:07:54,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-22 13:07:54,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-22 13:07:54,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:07:54,058 INFO L225 Difference]: With dead ends: 165 [2020-11-22 13:07:54,059 INFO L226 Difference]: Without dead ends: 87 [2020-11-22 13:07:54,059 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 13:07:54,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-22 13:07:54,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-11-22 13:07:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-11-22 13:07:54,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 176 transitions. [2020-11-22 13:07:54,062 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 176 transitions. Word has length 16 [2020-11-22 13:07:54,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:07:54,063 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 176 transitions. [2020-11-22 13:07:54,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 13:07:54,063 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 176 transitions. [2020-11-22 13:07:54,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-22 13:07:54,063 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:07:54,063 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 13:07:54,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-22 13:07:54,064 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:07:54,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:07:54,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2071543388, now seen corresponding path program 1 times [2020-11-22 13:07:54,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:07:54,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471082613] [2020-11-22 13:07:54,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:07:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:07:54,166 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 13:07:54,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471082613] [2020-11-22 13:07:54,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:07:54,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 13:07:54,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514141667] [2020-11-22 13:07:54,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 13:07:54,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:07:54,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 13:07:54,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-22 13:07:54,168 INFO L87 Difference]: Start difference. First operand 87 states and 176 transitions. Second operand 6 states. [2020-11-22 13:07:54,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:07:54,264 INFO L93 Difference]: Finished difference Result 141 states and 289 transitions. [2020-11-22 13:07:54,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 13:07:54,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-22 13:07:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:07:54,266 INFO L225 Difference]: With dead ends: 141 [2020-11-22 13:07:54,266 INFO L226 Difference]: Without dead ends: 75 [2020-11-22 13:07:54,266 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-22 13:07:54,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-11-22 13:07:54,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-11-22 13:07:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-22 13:07:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 152 transitions. [2020-11-22 13:07:54,269 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 152 transitions. Word has length 20 [2020-11-22 13:07:54,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:07:54,271 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 152 transitions. [2020-11-22 13:07:54,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 13:07:54,271 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 152 transitions. [2020-11-22 13:07:54,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-22 13:07:54,272 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:07:54,272 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 13:07:54,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-22 13:07:54,272 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:07:54,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:07:54,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1943956750, now seen corresponding path program 2 times [2020-11-22 13:07:54,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:07:54,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629419329] [2020-11-22 13:07:54,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:07:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:07:54,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 13:07:54,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629419329] [2020-11-22 13:07:54,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:07:54,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 13:07:54,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001512420] [2020-11-22 13:07:54,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 13:07:54,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:07:54,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 13:07:54,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 13:07:54,338 INFO L87 Difference]: Start difference. First operand 75 states and 152 transitions. Second operand 4 states. [2020-11-22 13:07:54,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:07:54,368 INFO L93 Difference]: Finished difference Result 101 states and 200 transitions. [2020-11-22 13:07:54,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-22 13:07:54,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-11-22 13:07:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:07:54,369 INFO L225 Difference]: With dead ends: 101 [2020-11-22 13:07:54,369 INFO L226 Difference]: Without dead ends: 47 [2020-11-22 13:07:54,370 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 13:07:54,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-22 13:07:54,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-11-22 13:07:54,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-22 13:07:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 80 transitions. [2020-11-22 13:07:54,371 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 80 transitions. Word has length 20 [2020-11-22 13:07:54,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:07:54,372 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 80 transitions. [2020-11-22 13:07:54,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 13:07:54,372 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2020-11-22 13:07:54,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-22 13:07:54,372 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:07:54,372 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 13:07:54,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-22 13:07:54,373 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:07:54,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:07:54,373 INFO L82 PathProgramCache]: Analyzing trace with hash -7896946, now seen corresponding path program 3 times [2020-11-22 13:07:54,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:07:54,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534172464] [2020-11-22 13:07:54,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:07:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-22 13:07:54,423 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-22 13:07:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-22 13:07:54,464 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-22 13:07:54,493 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-22 13:07:54,494 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-22 13:07:54,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-22 13:07:54,495 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-22 13:07:54,505 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L2-->L831: Formula: (let ((.cse7 (= (mod ~y$r_buff0_thd0~0_In-158242198 256) 0)) (.cse6 (= (mod ~y$w_buff0_used~0_In-158242198 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-158242198 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-158242198 256) 0))) (let ((.cse3 (or .cse9 .cse8)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse2 (or .cse7 .cse6)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (or (and .cse0 (= ~y~0_Out-158242198 ~y$w_buff0~0_In-158242198) .cse1) (and .cse2 (or (and (= ~y~0_Out-158242198 ~y~0_In-158242198) .cse3) (and .cse4 .cse5 (= ~y~0_Out-158242198 ~y$w_buff1~0_In-158242198))))) (= ~y$r_buff1_thd0~0_Out-158242198 ~y$r_buff1_thd0~0_In-158242198) (= ~y$r_buff0_thd0~0_In-158242198 ~y$r_buff0_thd0~0_Out-158242198) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-158242198 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-158242198|) (or (and (= ~y$w_buff1_used~0_In-158242198 ~y$w_buff1_used~0_Out-158242198) .cse3) (and (= 0 ~y$w_buff1_used~0_Out-158242198) .cse4 .cse5)) (or (and (= ~y$w_buff0_used~0_In-158242198 ~y$w_buff0_used~0_Out-158242198) .cse2) (and (= ~y$w_buff0_used~0_Out-158242198 0) .cse0 .cse1)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-158242198 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-158242198|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-158242198, ~y$w_buff1~0=~y$w_buff1~0_In-158242198, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-158242198, ~y$w_buff0~0=~y$w_buff0~0_In-158242198, ~y~0=~y~0_In-158242198, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-158242198, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-158242198} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-158242198, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-158242198|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-158242198|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-158242198|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-158242198|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-158242198|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-158242198|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-158242198|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-158242198, ~y$w_buff1~0=~y$w_buff1~0_In-158242198, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-158242198, ~y$w_buff0~0=~y$w_buff0~0_In-158242198, ~y~0=~y~0_Out-158242198, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-158242198, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-158242198} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-11-22 13:07:54,509 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 13:07:54,510 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,510 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 13:07:54,510 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [777] [2020-11-22 13:07:54,512 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 13:07:54,512 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,512 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 13:07:54,512 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,512 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 13:07:54,513 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,513 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 13:07:54,513 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,513 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 13:07:54,513 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,514 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 13:07:54,514 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,514 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 13:07:54,514 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,514 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 13:07:54,515 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,515 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 13:07:54,515 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,515 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 13:07:54,515 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,515 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 13:07:54,515 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,516 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 13:07:54,516 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,517 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 13:07:54,517 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,517 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 13:07:54,517 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,517 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 13:07:54,517 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,518 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 13:07:54,518 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,518 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 13:07:54,518 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,518 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 13:07:54,518 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,519 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 13:07:54,519 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,519 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 13:07:54,519 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,519 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 13:07:54,519 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,520 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 13:07:54,520 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:07:54 BasicIcfg [2020-11-22 13:07:54,576 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-22 13:07:54,576 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-22 13:07:54,576 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-22 13:07:54,577 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-22 13:07:54,577 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:07:41" (3/4) ... [2020-11-22 13:07:54,579 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-22 13:07:54,586 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L2-->L831: Formula: (let ((.cse7 (= (mod ~y$r_buff0_thd0~0_In-158242198 256) 0)) (.cse6 (= (mod ~y$w_buff0_used~0_In-158242198 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-158242198 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-158242198 256) 0))) (let ((.cse3 (or .cse9 .cse8)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse2 (or .cse7 .cse6)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (or (and .cse0 (= ~y~0_Out-158242198 ~y$w_buff0~0_In-158242198) .cse1) (and .cse2 (or (and (= ~y~0_Out-158242198 ~y~0_In-158242198) .cse3) (and .cse4 .cse5 (= ~y~0_Out-158242198 ~y$w_buff1~0_In-158242198))))) (= ~y$r_buff1_thd0~0_Out-158242198 ~y$r_buff1_thd0~0_In-158242198) (= ~y$r_buff0_thd0~0_In-158242198 ~y$r_buff0_thd0~0_Out-158242198) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-158242198 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-158242198|) (or (and (= ~y$w_buff1_used~0_In-158242198 ~y$w_buff1_used~0_Out-158242198) .cse3) (and (= 0 ~y$w_buff1_used~0_Out-158242198) .cse4 .cse5)) (or (and (= ~y$w_buff0_used~0_In-158242198 ~y$w_buff0_used~0_Out-158242198) .cse2) (and (= ~y$w_buff0_used~0_Out-158242198 0) .cse0 .cse1)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-158242198 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-158242198|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-158242198, ~y$w_buff1~0=~y$w_buff1~0_In-158242198, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-158242198, ~y$w_buff0~0=~y$w_buff0~0_In-158242198, ~y~0=~y~0_In-158242198, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-158242198, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-158242198} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-158242198, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-158242198|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-158242198|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-158242198|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-158242198|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-158242198|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-158242198|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-158242198|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-158242198, ~y$w_buff1~0=~y$w_buff1~0_In-158242198, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-158242198, ~y$w_buff0~0=~y$w_buff0~0_In-158242198, ~y~0=~y~0_Out-158242198, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-158242198, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-158242198} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-11-22 13:07:54,591 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 13:07:54,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,591 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 13:07:54,591 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [777] [2020-11-22 13:07:54,592 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 13:07:54,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,593 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 13:07:54,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,593 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 13:07:54,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,594 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 13:07:54,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,594 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 13:07:54,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,595 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 13:07:54,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,595 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 13:07:54,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,595 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 13:07:54,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,595 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 13:07:54,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,595 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 13:07:54,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,595 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 13:07:54,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,596 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 13:07:54,596 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,596 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 13:07:54,596 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,596 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 13:07:54,596 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,596 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 13:07:54,596 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,596 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 13:07:54,596 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,596 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 13:07:54,596 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,597 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 13:07:54,597 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,597 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 13:07:54,597 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,597 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 13:07:54,597 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,597 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 13:07:54,597 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,598 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 13:07:54,598 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:07:54,694 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e66f78c7-0857-4a73-ab00-a4dc9c493fcf/bin/utaipan/witness.graphml [2020-11-22 13:07:54,694 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-22 13:07:54,695 INFO L168 Benchmark]: Toolchain (without parser) took 16262.63 ms. Allocated memory was 90.2 MB in the beginning and 285.2 MB in the end (delta: 195.0 MB). Free memory was 53.9 MB in the beginning and 152.8 MB in the end (delta: -98.9 MB). Peak memory consumption was 96.5 MB. Max. memory is 16.1 GB. [2020-11-22 13:07:54,695 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 90.2 MB. Free memory was 71.8 MB in the beginning and 71.7 MB in the end (delta: 122.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-22 13:07:54,696 INFO L168 Benchmark]: CACSL2BoogieTranslator took 796.40 ms. Allocated memory is still 90.2 MB. Free memory was 53.7 MB in the beginning and 42.7 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-22 13:07:54,696 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.12 ms. Allocated memory is still 90.2 MB. Free memory was 42.7 MB in the beginning and 39.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-22 13:07:54,696 INFO L168 Benchmark]: Boogie Preprocessor took 71.42 ms. Allocated memory is still 90.2 MB. Free memory was 39.8 MB in the beginning and 37.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-22 13:07:54,697 INFO L168 Benchmark]: RCFGBuilder took 2187.88 ms. Allocated memory was 90.2 MB in the beginning and 136.3 MB in the end (delta: 46.1 MB). Free memory was 37.8 MB in the beginning and 54.8 MB in the end (delta: -17.0 MB). Peak memory consumption was 32.9 MB. Max. memory is 16.1 GB. [2020-11-22 13:07:54,697 INFO L168 Benchmark]: TraceAbstraction took 12995.66 ms. Allocated memory was 136.3 MB in the beginning and 285.2 MB in the end (delta: 148.9 MB). Free memory was 54.8 MB in the beginning and 166.4 MB in the end (delta: -111.6 MB). Peak memory consumption was 38.4 MB. Max. memory is 16.1 GB. [2020-11-22 13:07:54,698 INFO L168 Benchmark]: Witness Printer took 117.64 ms. Allocated memory is still 285.2 MB. Free memory was 165.4 MB in the beginning and 152.8 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-22 13:07:54,700 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.16 ms. Allocated memory is still 90.2 MB. Free memory was 71.8 MB in the beginning and 71.7 MB in the end (delta: 122.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 796.40 ms. Allocated memory is still 90.2 MB. Free memory was 53.7 MB in the beginning and 42.7 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 85.12 ms. Allocated memory is still 90.2 MB. Free memory was 42.7 MB in the beginning and 39.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 71.42 ms. Allocated memory is still 90.2 MB. Free memory was 39.8 MB in the beginning and 37.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2187.88 ms. Allocated memory was 90.2 MB in the beginning and 136.3 MB in the end (delta: 46.1 MB). Free memory was 37.8 MB in the beginning and 54.8 MB in the end (delta: -17.0 MB). Peak memory consumption was 32.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 12995.66 ms. Allocated memory was 136.3 MB in the beginning and 285.2 MB in the end (delta: 148.9 MB). Free memory was 54.8 MB in the beginning and 166.4 MB in the end (delta: -111.6 MB). Peak memory consumption was 38.4 MB. Max. memory is 16.1 GB. * Witness Printer took 117.64 ms. Allocated memory is still 285.2 MB. Free memory was 165.4 MB in the beginning and 152.8 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1270 VarBasedMoverChecksPositive, 73 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 45 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 109 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.7s, 107 PlacesBefore, 35 PlacesAfterwards, 100 TransitionsBefore, 26 TransitionsAfterwards, 1746 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 4721 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2528; [L816] FCALL, FORK 0 pthread_create(&t2528, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t2529; [L818] FCALL, FORK 0 pthread_create(&t2529, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] 0 pthread_t t2530; [L820] FCALL, FORK 0 pthread_create(&t2530, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L18] COND TRUE 3 !expression [L17] COND FALSE 3 !(0) [L17] 3 __assert_fail ("0", "safe031_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 3 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L839] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe031_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.7s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.8s, HoareTripleCheckerStatistics: 274 SDtfs, 272 SDslu, 378 SDs, 0 SdLazy, 212 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 49 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 9804 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...