./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_301fe163-514e-4fb8-8bc8-15404c76add9/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_301fe163-514e-4fb8-8bc8-15404c76add9/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_301fe163-514e-4fb8-8bc8-15404c76add9/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_301fe163-514e-4fb8-8bc8-15404c76add9/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_301fe163-514e-4fb8-8bc8-15404c76add9/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_301fe163-514e-4fb8-8bc8-15404c76add9/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e635a02f2d7438928806d3267842b22f0deee00c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.25-f470102 [2019-12-07 20:19:39,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:19:39,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:19:39,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:19:39,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:19:39,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:19:39,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:19:39,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:19:39,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:19:39,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:19:39,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:19:39,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:19:39,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:19:39,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:19:39,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:19:39,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:19:39,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:19:39,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:19:39,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:19:39,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:19:39,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:19:39,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:19:39,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:19:39,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:19:39,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:19:39,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:19:39,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:19:39,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:19:39,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:19:39,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:19:39,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:19:39,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:19:39,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:19:39,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:19:39,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:19:39,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:19:39,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:19:39,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:19:39,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:19:39,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:19:39,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:19:39,416 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_301fe163-514e-4fb8-8bc8-15404c76add9/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:19:39,429 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:19:39,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:19:39,430 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:19:39,430 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:19:39,430 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:19:39,430 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:19:39,430 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:19:39,431 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:19:39,431 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:19:39,431 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:19:39,431 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:19:39,431 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:19:39,432 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:19:39,432 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:19:39,432 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:19:39,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:19:39,433 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:19:39,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:19:39,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:19:39,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:19:39,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:19:39,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:19:39,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:19:39,434 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:19:39,434 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:19:39,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:19:39,434 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:19:39,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:19:39,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:19:39,435 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:19:39,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:19:39,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:19:39,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:19:39,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:19:39,436 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:19:39,436 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:19:39,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:19:39,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:19:39,437 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:19:39,437 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:19:39,437 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_301fe163-514e-4fb8-8bc8-15404c76add9/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(__VERIFIER_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 -> e635a02f2d7438928806d3267842b22f0deee00c [2019-12-07 20:19:39,544 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:19:39,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:19:39,554 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:19:39,555 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:19:39,555 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:19:39,556 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_301fe163-514e-4fb8-8bc8-15404c76add9/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix042_pso.opt.i [2019-12-07 20:19:39,592 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_301fe163-514e-4fb8-8bc8-15404c76add9/bin/utaipan/data/f7275b3f1/04089a979a4d43e2805d004af1f9efc6/FLAGe66e503a2 [2019-12-07 20:19:40,039 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:19:40,040 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_301fe163-514e-4fb8-8bc8-15404c76add9/sv-benchmarks/c/pthread-wmm/mix042_pso.opt.i [2019-12-07 20:19:40,050 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_301fe163-514e-4fb8-8bc8-15404c76add9/bin/utaipan/data/f7275b3f1/04089a979a4d43e2805d004af1f9efc6/FLAGe66e503a2 [2019-12-07 20:19:40,058 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_301fe163-514e-4fb8-8bc8-15404c76add9/bin/utaipan/data/f7275b3f1/04089a979a4d43e2805d004af1f9efc6 [2019-12-07 20:19:40,060 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:19:40,061 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:19:40,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:19:40,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:19:40,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:19:40,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:19:40" (1/1) ... [2019-12-07 20:19:40,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:40, skipping insertion in model container [2019-12-07 20:19:40,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:19:40" (1/1) ... [2019-12-07 20:19:40,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:19:40,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:19:40,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:19:40,357 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:19:40,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:19:40,444 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:19:40,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:40 WrapperNode [2019-12-07 20:19:40,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:19:40,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:19:40,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:19:40,445 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:19:40,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:40" (1/1) ... [2019-12-07 20:19:40,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:40" (1/1) ... [2019-12-07 20:19:40,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:19:40,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:19:40,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:19:40,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:19:40,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:40" (1/1) ... [2019-12-07 20:19:40,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:40" (1/1) ... [2019-12-07 20:19:40,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:40" (1/1) ... [2019-12-07 20:19:40,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:40" (1/1) ... [2019-12-07 20:19:40,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:40" (1/1) ... [2019-12-07 20:19:40,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:40" (1/1) ... [2019-12-07 20:19:40,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:40" (1/1) ... [2019-12-07 20:19:40,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:19:40,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:19:40,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:19:40,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:19:40,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_301fe163-514e-4fb8-8bc8-15404c76add9/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 [2019-12-07 20:19:40,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:19:40,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 20:19:40,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:19:40,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:19:40,554 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 20:19:40,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 20:19:40,554 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 20:19:40,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 20:19:40,555 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 20:19:40,555 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 20:19:40,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 20:19:40,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:19:40,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:19:40,556 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 20:19:40,898 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:19:40,898 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 20:19:40,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:19:40 BoogieIcfgContainer [2019-12-07 20:19:40,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:19:40,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:19:40,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:19:40,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:19:40,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:19:40" (1/3) ... [2019-12-07 20:19:40,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de32d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:19:40, skipping insertion in model container [2019-12-07 20:19:40,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:40" (2/3) ... [2019-12-07 20:19:40,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de32d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:19:40, skipping insertion in model container [2019-12-07 20:19:40,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:19:40" (3/3) ... [2019-12-07 20:19:40,904 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_pso.opt.i [2019-12-07 20:19:40,910 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 20:19:40,910 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:19:40,916 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 20:19:40,916 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 20:19:40,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,941 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,941 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,943 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,943 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,949 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,949 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,950 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,950 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,950 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:40,968 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 20:19:40,985 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:19:40,985 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:19:40,985 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:19:40,986 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:19:40,986 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:19:40,986 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:19:40,986 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:19:40,986 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:19:40,997 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-07 20:19:40,998 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-07 20:19:41,055 INFO L134 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-07 20:19:41,056 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:19:41,066 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 476 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 20:19:41,079 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-07 20:19:41,113 INFO L134 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-07 20:19:41,113 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:19:41,117 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 476 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 20:19:41,127 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-07 20:19:41,128 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 20:19:43,863 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 20:19:43,951 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50142 [2019-12-07 20:19:43,951 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-07 20:19:43,953 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 86 transitions [2019-12-07 20:19:44,544 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-07 20:19:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-07 20:19:44,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 20:19:44,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:44,550 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:44,550 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:44,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:44,554 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-07 20:19:44,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:44,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542582258] [2019-12-07 20:19:44,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:44,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542582258] [2019-12-07 20:19:44,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:44,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:19:44,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164829703] [2019-12-07 20:19:44,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:19:44,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:44,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:19:44,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:44,718 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-07 20:19:44,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:44,946 INFO L93 Difference]: Finished difference Result 14182 states and 53160 transitions. [2019-12-07 20:19:44,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:19:44,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 20:19:44,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:45,052 INFO L225 Difference]: With dead ends: 14182 [2019-12-07 20:19:45,052 INFO L226 Difference]: Without dead ends: 13870 [2019-12-07 20:19:45,053 INFO L630 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 [2019-12-07 20:19:45,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-07 20:19:45,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-07 20:19:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-07 20:19:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 52042 transitions. [2019-12-07 20:19:45,522 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 52042 transitions. Word has length 7 [2019-12-07 20:19:45,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:45,523 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 52042 transitions. [2019-12-07 20:19:45,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:19:45,523 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 52042 transitions. [2019-12-07 20:19:45,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:19:45,526 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:45,526 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:45,527 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:45,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:45,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-07 20:19:45,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:45,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836544990] [2019-12-07 20:19:45,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:45,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:45,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836544990] [2019-12-07 20:19:45,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:45,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:19:45,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234329303] [2019-12-07 20:19:45,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:19:45,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:45,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:19:45,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:19:45,598 INFO L87 Difference]: Start difference. First operand 13870 states and 52042 transitions. Second operand 4 states. [2019-12-07 20:19:45,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:45,730 INFO L93 Difference]: Finished difference Result 8456 states and 27401 transitions. [2019-12-07 20:19:45,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:19:45,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 20:19:45,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:45,749 INFO L225 Difference]: With dead ends: 8456 [2019-12-07 20:19:45,749 INFO L226 Difference]: Without dead ends: 8144 [2019-12-07 20:19:45,750 INFO L630 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 [2019-12-07 20:19:45,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8144 states. [2019-12-07 20:19:45,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8144 to 8144. [2019-12-07 20:19:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8144 states. [2019-12-07 20:19:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8144 states to 8144 states and 26463 transitions. [2019-12-07 20:19:45,912 INFO L78 Accepts]: Start accepts. Automaton has 8144 states and 26463 transitions. Word has length 13 [2019-12-07 20:19:45,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:45,912 INFO L462 AbstractCegarLoop]: Abstraction has 8144 states and 26463 transitions. [2019-12-07 20:19:45,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:19:45,912 INFO L276 IsEmpty]: Start isEmpty. Operand 8144 states and 26463 transitions. [2019-12-07 20:19:45,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:19:45,914 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:45,914 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:45,914 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:45,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:45,914 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-07 20:19:45,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:45,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486222421] [2019-12-07 20:19:45,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:45,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:45,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486222421] [2019-12-07 20:19:45,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:45,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:19:45,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176079259] [2019-12-07 20:19:45,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:19:45,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:45,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:19:45,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:19:45,964 INFO L87 Difference]: Start difference. First operand 8144 states and 26463 transitions. Second operand 4 states. [2019-12-07 20:19:46,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:46,171 INFO L93 Difference]: Finished difference Result 12699 states and 39415 transitions. [2019-12-07 20:19:46,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:19:46,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 20:19:46,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:46,200 INFO L225 Difference]: With dead ends: 12699 [2019-12-07 20:19:46,201 INFO L226 Difference]: Without dead ends: 12666 [2019-12-07 20:19:46,201 INFO L630 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 [2019-12-07 20:19:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12666 states. [2019-12-07 20:19:46,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12666 to 11570. [2019-12-07 20:19:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11570 states. [2019-12-07 20:19:46,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11570 states to 11570 states and 36365 transitions. [2019-12-07 20:19:46,421 INFO L78 Accepts]: Start accepts. Automaton has 11570 states and 36365 transitions. Word has length 13 [2019-12-07 20:19:46,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:46,421 INFO L462 AbstractCegarLoop]: Abstraction has 11570 states and 36365 transitions. [2019-12-07 20:19:46,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:19:46,421 INFO L276 IsEmpty]: Start isEmpty. Operand 11570 states and 36365 transitions. [2019-12-07 20:19:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 20:19:46,422 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:46,422 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:46,422 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:46,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:46,422 INFO L82 PathProgramCache]: Analyzing trace with hash 26449862, now seen corresponding path program 1 times [2019-12-07 20:19:46,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:46,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086410830] [2019-12-07 20:19:46,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:46,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086410830] [2019-12-07 20:19:46,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:46,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:19:46,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203296048] [2019-12-07 20:19:46,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:19:46,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:46,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:19:46,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:19:46,475 INFO L87 Difference]: Start difference. First operand 11570 states and 36365 transitions. Second operand 4 states. [2019-12-07 20:19:46,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:46,635 INFO L93 Difference]: Finished difference Result 14076 states and 43682 transitions. [2019-12-07 20:19:46,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:19:46,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 20:19:46,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:46,663 INFO L225 Difference]: With dead ends: 14076 [2019-12-07 20:19:46,663 INFO L226 Difference]: Without dead ends: 14076 [2019-12-07 20:19:46,664 INFO L630 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 [2019-12-07 20:19:46,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14076 states. [2019-12-07 20:19:46,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14076 to 12661. [2019-12-07 20:19:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12661 states. [2019-12-07 20:19:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12661 states to 12661 states and 39651 transitions. [2019-12-07 20:19:46,922 INFO L78 Accepts]: Start accepts. Automaton has 12661 states and 39651 transitions. Word has length 14 [2019-12-07 20:19:46,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:46,922 INFO L462 AbstractCegarLoop]: Abstraction has 12661 states and 39651 transitions. [2019-12-07 20:19:46,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:19:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 12661 states and 39651 transitions. [2019-12-07 20:19:46,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:19:46,925 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:46,925 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:46,925 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:46,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:46,925 INFO L82 PathProgramCache]: Analyzing trace with hash -21144877, now seen corresponding path program 1 times [2019-12-07 20:19:46,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:46,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661088274] [2019-12-07 20:19:46,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:46,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:46,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661088274] [2019-12-07 20:19:46,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:46,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:19:46,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757333061] [2019-12-07 20:19:46,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:19:46,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:46,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:19:46,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:19:46,984 INFO L87 Difference]: Start difference. First operand 12661 states and 39651 transitions. Second operand 5 states. [2019-12-07 20:19:47,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:47,263 INFO L93 Difference]: Finished difference Result 16929 states and 51829 transitions. [2019-12-07 20:19:47,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:19:47,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-07 20:19:47,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:47,289 INFO L225 Difference]: With dead ends: 16929 [2019-12-07 20:19:47,289 INFO L226 Difference]: Without dead ends: 16922 [2019-12-07 20:19:47,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:19:47,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16922 states. [2019-12-07 20:19:47,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16922 to 12812. [2019-12-07 20:19:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12812 states. [2019-12-07 20:19:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12812 states to 12812 states and 40017 transitions. [2019-12-07 20:19:47,513 INFO L78 Accepts]: Start accepts. Automaton has 12812 states and 40017 transitions. Word has length 20 [2019-12-07 20:19:47,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:47,513 INFO L462 AbstractCegarLoop]: Abstraction has 12812 states and 40017 transitions. [2019-12-07 20:19:47,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:19:47,513 INFO L276 IsEmpty]: Start isEmpty. Operand 12812 states and 40017 transitions. [2019-12-07 20:19:47,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 20:19:47,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:47,521 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:47,521 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:47,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:47,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1806206056, now seen corresponding path program 1 times [2019-12-07 20:19:47,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:47,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125344611] [2019-12-07 20:19:47,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:47,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125344611] [2019-12-07 20:19:47,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:47,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:19:47,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123628204] [2019-12-07 20:19:47,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:19:47,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:47,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:19:47,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:19:47,593 INFO L87 Difference]: Start difference. First operand 12812 states and 40017 transitions. Second operand 6 states. [2019-12-07 20:19:47,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:47,885 INFO L93 Difference]: Finished difference Result 17980 states and 54854 transitions. [2019-12-07 20:19:47,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:19:47,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-07 20:19:47,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:47,907 INFO L225 Difference]: With dead ends: 17980 [2019-12-07 20:19:47,908 INFO L226 Difference]: Without dead ends: 17964 [2019-12-07 20:19:47,908 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:19:47,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17964 states. [2019-12-07 20:19:48,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17964 to 15695. [2019-12-07 20:19:48,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15695 states. [2019-12-07 20:19:48,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15695 states to 15695 states and 48333 transitions. [2019-12-07 20:19:48,196 INFO L78 Accepts]: Start accepts. Automaton has 15695 states and 48333 transitions. Word has length 28 [2019-12-07 20:19:48,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:48,197 INFO L462 AbstractCegarLoop]: Abstraction has 15695 states and 48333 transitions. [2019-12-07 20:19:48,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:19:48,197 INFO L276 IsEmpty]: Start isEmpty. Operand 15695 states and 48333 transitions. [2019-12-07 20:19:48,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 20:19:48,208 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:48,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:48,208 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:48,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:48,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1223733812, now seen corresponding path program 1 times [2019-12-07 20:19:48,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:48,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559890767] [2019-12-07 20:19:48,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:48,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:48,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559890767] [2019-12-07 20:19:48,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:48,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:19:48,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059191237] [2019-12-07 20:19:48,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:19:48,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:48,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:19:48,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:48,244 INFO L87 Difference]: Start difference. First operand 15695 states and 48333 transitions. Second operand 3 states. [2019-12-07 20:19:48,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:48,332 INFO L93 Difference]: Finished difference Result 19865 states and 61636 transitions. [2019-12-07 20:19:48,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:19:48,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 20:19:48,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:48,354 INFO L225 Difference]: With dead ends: 19865 [2019-12-07 20:19:48,354 INFO L226 Difference]: Without dead ends: 19865 [2019-12-07 20:19:48,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:48,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19865 states. [2019-12-07 20:19:48,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19865 to 17509. [2019-12-07 20:19:48,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17509 states. [2019-12-07 20:19:48,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17509 states to 17509 states and 54532 transitions. [2019-12-07 20:19:48,616 INFO L78 Accepts]: Start accepts. Automaton has 17509 states and 54532 transitions. Word has length 34 [2019-12-07 20:19:48,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:48,616 INFO L462 AbstractCegarLoop]: Abstraction has 17509 states and 54532 transitions. [2019-12-07 20:19:48,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:19:48,616 INFO L276 IsEmpty]: Start isEmpty. Operand 17509 states and 54532 transitions. [2019-12-07 20:19:48,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 20:19:48,628 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:48,628 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:48,628 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:48,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:48,628 INFO L82 PathProgramCache]: Analyzing trace with hash 345963664, now seen corresponding path program 1 times [2019-12-07 20:19:48,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:48,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750274843] [2019-12-07 20:19:48,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:48,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750274843] [2019-12-07 20:19:48,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:48,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:19:48,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431655259] [2019-12-07 20:19:48,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:19:48,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:48,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:19:48,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:48,673 INFO L87 Difference]: Start difference. First operand 17509 states and 54532 transitions. Second operand 3 states. [2019-12-07 20:19:48,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:48,759 INFO L93 Difference]: Finished difference Result 17509 states and 54339 transitions. [2019-12-07 20:19:48,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:19:48,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 20:19:48,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:48,780 INFO L225 Difference]: With dead ends: 17509 [2019-12-07 20:19:48,780 INFO L226 Difference]: Without dead ends: 17509 [2019-12-07 20:19:48,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:48,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17509 states. [2019-12-07 20:19:49,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17509 to 17509. [2019-12-07 20:19:49,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17509 states. [2019-12-07 20:19:49,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17509 states to 17509 states and 54339 transitions. [2019-12-07 20:19:49,071 INFO L78 Accepts]: Start accepts. Automaton has 17509 states and 54339 transitions. Word has length 34 [2019-12-07 20:19:49,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:49,071 INFO L462 AbstractCegarLoop]: Abstraction has 17509 states and 54339 transitions. [2019-12-07 20:19:49,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:19:49,071 INFO L276 IsEmpty]: Start isEmpty. Operand 17509 states and 54339 transitions. [2019-12-07 20:19:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 20:19:49,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:49,082 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:49,083 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:49,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:49,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1096312539, now seen corresponding path program 1 times [2019-12-07 20:19:49,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:49,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444545391] [2019-12-07 20:19:49,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:49,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444545391] [2019-12-07 20:19:49,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:49,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:19:49,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939758335] [2019-12-07 20:19:49,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:19:49,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:49,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:19:49,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:19:49,146 INFO L87 Difference]: Start difference. First operand 17509 states and 54339 transitions. Second operand 7 states. [2019-12-07 20:19:49,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:49,672 INFO L93 Difference]: Finished difference Result 23341 states and 70914 transitions. [2019-12-07 20:19:49,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 20:19:49,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-07 20:19:49,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:49,697 INFO L225 Difference]: With dead ends: 23341 [2019-12-07 20:19:49,697 INFO L226 Difference]: Without dead ends: 23313 [2019-12-07 20:19:49,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-07 20:19:49,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23313 states. [2019-12-07 20:19:49,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23313 to 15958. [2019-12-07 20:19:49,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15958 states. [2019-12-07 20:19:49,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15958 states to 15958 states and 49857 transitions. [2019-12-07 20:19:49,961 INFO L78 Accepts]: Start accepts. Automaton has 15958 states and 49857 transitions. Word has length 34 [2019-12-07 20:19:49,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:49,961 INFO L462 AbstractCegarLoop]: Abstraction has 15958 states and 49857 transitions. [2019-12-07 20:19:49,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:19:49,961 INFO L276 IsEmpty]: Start isEmpty. Operand 15958 states and 49857 transitions. [2019-12-07 20:19:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 20:19:49,971 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:49,971 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:49,971 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:49,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:49,972 INFO L82 PathProgramCache]: Analyzing trace with hash -308537285, now seen corresponding path program 1 times [2019-12-07 20:19:49,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:49,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170496228] [2019-12-07 20:19:49,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:50,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170496228] [2019-12-07 20:19:50,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:50,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:19:50,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577575486] [2019-12-07 20:19:50,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:19:50,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:50,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:19:50,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:19:50,025 INFO L87 Difference]: Start difference. First operand 15958 states and 49857 transitions. Second operand 5 states. [2019-12-07 20:19:50,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:50,055 INFO L93 Difference]: Finished difference Result 2712 states and 6343 transitions. [2019-12-07 20:19:50,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:19:50,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 20:19:50,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:50,056 INFO L225 Difference]: With dead ends: 2712 [2019-12-07 20:19:50,056 INFO L226 Difference]: Without dead ends: 2403 [2019-12-07 20:19:50,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:19:50,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2019-12-07 20:19:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 2403. [2019-12-07 20:19:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2403 states. [2019-12-07 20:19:50,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 5482 transitions. [2019-12-07 20:19:50,079 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 5482 transitions. Word has length 34 [2019-12-07 20:19:50,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:50,079 INFO L462 AbstractCegarLoop]: Abstraction has 2403 states and 5482 transitions. [2019-12-07 20:19:50,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:19:50,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 5482 transitions. [2019-12-07 20:19:50,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 20:19:50,081 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:50,081 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:50,081 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:50,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:50,082 INFO L82 PathProgramCache]: Analyzing trace with hash 682662632, now seen corresponding path program 1 times [2019-12-07 20:19:50,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:50,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23066307] [2019-12-07 20:19:50,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:50,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23066307] [2019-12-07 20:19:50,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:50,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:19:50,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590151413] [2019-12-07 20:19:50,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:19:50,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:50,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:19:50,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:19:50,132 INFO L87 Difference]: Start difference. First operand 2403 states and 5482 transitions. Second operand 6 states. [2019-12-07 20:19:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:50,167 INFO L93 Difference]: Finished difference Result 708 states and 1600 transitions. [2019-12-07 20:19:50,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:19:50,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-07 20:19:50,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:50,168 INFO L225 Difference]: With dead ends: 708 [2019-12-07 20:19:50,168 INFO L226 Difference]: Without dead ends: 662 [2019-12-07 20:19:50,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:19:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-12-07 20:19:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 606. [2019-12-07 20:19:50,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-12-07 20:19:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1378 transitions. [2019-12-07 20:19:50,173 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1378 transitions. Word has length 45 [2019-12-07 20:19:50,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:50,173 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1378 transitions. [2019-12-07 20:19:50,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:19:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1378 transitions. [2019-12-07 20:19:50,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 20:19:50,175 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:50,175 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:50,175 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:50,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:50,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1345831558, now seen corresponding path program 1 times [2019-12-07 20:19:50,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:50,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316657213] [2019-12-07 20:19:50,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:50,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316657213] [2019-12-07 20:19:50,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:50,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:19:50,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492042107] [2019-12-07 20:19:50,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:19:50,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:50,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:19:50,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:19:50,234 INFO L87 Difference]: Start difference. First operand 606 states and 1378 transitions. Second operand 5 states. [2019-12-07 20:19:50,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:50,364 INFO L93 Difference]: Finished difference Result 877 states and 2007 transitions. [2019-12-07 20:19:50,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:19:50,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-07 20:19:50,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:50,365 INFO L225 Difference]: With dead ends: 877 [2019-12-07 20:19:50,365 INFO L226 Difference]: Without dead ends: 877 [2019-12-07 20:19:50,366 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:19:50,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-12-07 20:19:50,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 642. [2019-12-07 20:19:50,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-07 20:19:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1470 transitions. [2019-12-07 20:19:50,371 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1470 transitions. Word has length 56 [2019-12-07 20:19:50,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:50,371 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 1470 transitions. [2019-12-07 20:19:50,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:19:50,371 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1470 transitions. [2019-12-07 20:19:50,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 20:19:50,372 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:50,372 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:50,372 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:50,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:50,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1993080434, now seen corresponding path program 2 times [2019-12-07 20:19:50,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:50,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025005851] [2019-12-07 20:19:50,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:50,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:50,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025005851] [2019-12-07 20:19:50,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:50,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:19:50,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321559997] [2019-12-07 20:19:50,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:19:50,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:50,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:19:50,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:50,412 INFO L87 Difference]: Start difference. First operand 642 states and 1470 transitions. Second operand 3 states. [2019-12-07 20:19:50,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:50,422 INFO L93 Difference]: Finished difference Result 642 states and 1440 transitions. [2019-12-07 20:19:50,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:19:50,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-07 20:19:50,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:50,423 INFO L225 Difference]: With dead ends: 642 [2019-12-07 20:19:50,423 INFO L226 Difference]: Without dead ends: 642 [2019-12-07 20:19:50,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:50,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-12-07 20:19:50,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 606. [2019-12-07 20:19:50,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-12-07 20:19:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1354 transitions. [2019-12-07 20:19:50,431 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1354 transitions. Word has length 56 [2019-12-07 20:19:50,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:50,431 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1354 transitions. [2019-12-07 20:19:50,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:19:50,431 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1354 transitions. [2019-12-07 20:19:50,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 20:19:50,433 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:50,433 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:50,433 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:50,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:50,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2052620165, now seen corresponding path program 1 times [2019-12-07 20:19:50,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:50,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594447571] [2019-12-07 20:19:50,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:50,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594447571] [2019-12-07 20:19:50,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:50,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 20:19:50,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945329885] [2019-12-07 20:19:50,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 20:19:50,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:50,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 20:19:50,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:19:50,623 INFO L87 Difference]: Start difference. First operand 606 states and 1354 transitions. Second operand 12 states. [2019-12-07 20:19:51,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:51,017 INFO L93 Difference]: Finished difference Result 1230 states and 2440 transitions. [2019-12-07 20:19:51,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 20:19:51,018 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-07 20:19:51,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:51,018 INFO L225 Difference]: With dead ends: 1230 [2019-12-07 20:19:51,018 INFO L226 Difference]: Without dead ends: 610 [2019-12-07 20:19:51,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2019-12-07 20:19:51,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-12-07 20:19:51,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 544. [2019-12-07 20:19:51,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-12-07 20:19:51,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1175 transitions. [2019-12-07 20:19:51,024 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1175 transitions. Word has length 57 [2019-12-07 20:19:51,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:51,024 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 1175 transitions. [2019-12-07 20:19:51,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 20:19:51,024 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1175 transitions. [2019-12-07 20:19:51,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 20:19:51,025 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:51,025 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:51,025 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:51,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:51,025 INFO L82 PathProgramCache]: Analyzing trace with hash -892812541, now seen corresponding path program 2 times [2019-12-07 20:19:51,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:51,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602868946] [2019-12-07 20:19:51,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:51,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602868946] [2019-12-07 20:19:51,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:51,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 20:19:51,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841442699] [2019-12-07 20:19:51,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 20:19:51,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:51,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 20:19:51,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:19:51,173 INFO L87 Difference]: Start difference. First operand 544 states and 1175 transitions. Second operand 12 states. [2019-12-07 20:19:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:51,410 INFO L93 Difference]: Finished difference Result 852 states and 1845 transitions. [2019-12-07 20:19:51,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 20:19:51,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-07 20:19:51,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:51,411 INFO L225 Difference]: With dead ends: 852 [2019-12-07 20:19:51,411 INFO L226 Difference]: Without dead ends: 822 [2019-12-07 20:19:51,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-07 20:19:51,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-12-07 20:19:51,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 748. [2019-12-07 20:19:51,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-12-07 20:19:51,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1628 transitions. [2019-12-07 20:19:51,419 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1628 transitions. Word has length 57 [2019-12-07 20:19:51,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:51,419 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1628 transitions. [2019-12-07 20:19:51,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 20:19:51,419 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1628 transitions. [2019-12-07 20:19:51,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 20:19:51,420 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:51,420 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:51,420 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:51,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:51,420 INFO L82 PathProgramCache]: Analyzing trace with hash 729108355, now seen corresponding path program 3 times [2019-12-07 20:19:51,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:51,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240210365] [2019-12-07 20:19:51,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:19:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:19:51,500 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 20:19:51,500 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:19:51,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~y$w_buff0_used~0_565 0) (= v_~y$w_buff1_used~0_304 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1114~0.base_27|) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff0_thd0~0_292 0) (= 0 v_~weak$$choice2~0_82) (= 0 v_~y$read_delayed_var~0.offset_8) (= (select .cse0 |v_ULTIMATE.start_main_~#t1114~0.base_27|) 0) (= 0 v_~__unbuffered_cnt~0_94) (= 0 v_~y$r_buff1_thd3~0_89) (= v_~y$read_delayed~0_8 0) (= 0 v_~y$r_buff1_thd2~0_113) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1114~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1114~0.base_27|) |v_ULTIMATE.start_main_~#t1114~0.offset_21| 0)) |v_#memory_int_15|) (= v_~main$tmp_guard1~0_30 0) (= v_~x~0_51 0) (= v_~y$w_buff1~0_136 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1114~0.base_27| 4)) (= 0 v_~y$r_buff0_thd2~0_108) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd1~0_41 0) (= 0 |v_ULTIMATE.start_main_~#t1114~0.offset_21|) (= v_~a~0_57 0) (= v_~y$mem_tmp~0_17 0) (= v_~z~0_41 0) (= 0 v_~y$r_buff1_thd1~0_40) (= v_~__unbuffered_p2_EBX~0_54 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t1114~0.base_27| 1)) (= v_~y~0_123 0) (= v_~y$r_buff1_thd0~0_196 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd3~0_130) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p0_EAX~0_39) (= 0 v_~weak$$choice0~0_13) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_34) (= 0 v_~y$w_buff0~0_162))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1114~0.offset=|v_ULTIMATE.start_main_~#t1114~0.offset_21|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_51|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_50|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_57, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_89, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_34, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ULTIMATE.start_main_~#t1115~0.base=|v_ULTIMATE.start_main_~#t1115~0.base_26|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_116|, ULTIMATE.start_main_~#t1116~0.offset=|v_ULTIMATE.start_main_~#t1116~0.offset_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_25|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_136, ULTIMATE.start_main_~#t1116~0.base=|v_ULTIMATE.start_main_~#t1116~0.base_21|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_~#t1115~0.offset=|v_ULTIMATE.start_main_~#t1115~0.offset_20|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_196, ~x~0=v_~x~0_51, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_565, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_34|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_49|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_31|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_27|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_27|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_28|, ~y$w_buff0~0=v_~y$w_buff0~0_162, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_130, ~y~0=v_~y~0_123, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_32|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_196|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_110|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_292, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1114~0.base=|v_ULTIMATE.start_main_~#t1114~0.base_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_41, ~weak$$choice2~0=v_~weak$$choice2~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_304} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1114~0.offset, ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1115~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1116~0.offset, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t1116~0.base, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1115~0.offset, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t1114~0.base, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 20:19:51,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1115~0.base_9| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1115~0.base_9|) (= |v_ULTIMATE.start_main_~#t1115~0.offset_8| 0) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1115~0.base_9|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1115~0.base_9| 1)) (not (= |v_ULTIMATE.start_main_~#t1115~0.base_9| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1115~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1115~0.base_9|) |v_ULTIMATE.start_main_~#t1115~0.offset_8| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~#t1115~0.offset=|v_ULTIMATE.start_main_~#t1115~0.offset_8|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1115~0.base=|v_ULTIMATE.start_main_~#t1115~0.base_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1115~0.offset, #length, ULTIMATE.start_main_~#t1115~0.base] because there is no mapped edge [2019-12-07 20:19:51,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1116~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1116~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1116~0.offset_10| 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1116~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1116~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1116~0.base_10|) |v_ULTIMATE.start_main_~#t1116~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1116~0.base_10| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1116~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1116~0.base=|v_ULTIMATE.start_main_~#t1116~0.base_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1116~0.offset=|v_ULTIMATE.start_main_~#t1116~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1116~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1116~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-07 20:19:51,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L4-->L789: Formula: (and (= ~y$r_buff0_thd3~0_In-2128820244 ~y$r_buff1_thd3~0_Out-2128820244) (= ~a~0_In-2128820244 ~__unbuffered_p2_EBX~0_Out-2128820244) (= ~y$r_buff0_thd3~0_Out-2128820244 1) (= ~y$r_buff1_thd0~0_Out-2128820244 ~y$r_buff0_thd0~0_In-2128820244) (= ~__unbuffered_p2_EAX~0_Out-2128820244 ~z~0_Out-2128820244) (= ~y$r_buff1_thd1~0_Out-2128820244 ~y$r_buff0_thd1~0_In-2128820244) (not (= 0 P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-2128820244)) (= ~y$r_buff1_thd2~0_Out-2128820244 ~y$r_buff0_thd2~0_In-2128820244) (= ~z~0_Out-2128820244 1)) InVars {~a~0=~a~0_In-2128820244, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2128820244, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2128820244, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2128820244, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2128820244, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-2128820244} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out-2128820244, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-2128820244, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-2128820244, ~a~0=~a~0_In-2128820244, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-2128820244, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-2128820244, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-2128820244, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2128820244, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2128820244, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2128820244, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out-2128820244, ~z~0=~z~0_Out-2128820244, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-2128820244} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 20:19:51,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_8 |v_P0Thread1of1ForFork2_#in~arg.base_10|) (= v_~a~0_22 1) (= v_~x~0_29 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= v_P0Thread1of1ForFork2_~arg.offset_8 |v_P0Thread1of1ForFork2_#in~arg.offset_10|) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~x~0=v_~x~0_29} OutVars{~a~0=v_~a~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_8, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, ~x~0=v_~x~0_29, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_8} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 20:19:51,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite3_Out1479466825| |P1Thread1of1ForFork0_#t~ite4_Out1479466825|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1479466825 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1479466825 256)))) (or (and (= ~y$w_buff1~0_In1479466825 |P1Thread1of1ForFork0_#t~ite3_Out1479466825|) .cse0 (not .cse1) (not .cse2)) (and .cse0 (= |P1Thread1of1ForFork0_#t~ite3_Out1479466825| ~y~0_In1479466825) (or .cse2 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1479466825, ~y$w_buff1~0=~y$w_buff1~0_In1479466825, ~y~0=~y~0_In1479466825, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1479466825} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1479466825, ~y$w_buff1~0=~y$w_buff1~0_In1479466825, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out1479466825|, ~y~0=~y~0_In1479466825, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out1479466825|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1479466825} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 20:19:51,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-369749280 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-369749280 256)))) (or (and (= ~y$w_buff0_used~0_In-369749280 |P2Thread1of1ForFork1_#t~ite11_Out-369749280|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite11_Out-369749280|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-369749280, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-369749280} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-369749280, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-369749280|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-369749280} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 20:19:51,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-237413785 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-237413785 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-237413785 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-237413785 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite12_Out-237413785| ~y$w_buff1_used~0_In-237413785)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork1_#t~ite12_Out-237413785| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-237413785, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-237413785, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-237413785, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-237413785} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-237413785, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-237413785, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-237413785, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-237413785|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-237413785} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 20:19:51,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2116707585 256))) (.cse2 (= ~y$r_buff0_thd3~0_Out2116707585 ~y$r_buff0_thd3~0_In2116707585)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In2116707585 256)))) (or (and (= 0 ~y$r_buff0_thd3~0_Out2116707585) (not .cse0) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2116707585, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2116707585} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out2116707585|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2116707585, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out2116707585} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 20:19:51,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1973018230 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1973018230 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1973018230 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1973018230 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite14_Out1973018230| ~y$r_buff1_thd3~0_In1973018230) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite14_Out1973018230| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1973018230, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1973018230, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1973018230, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1973018230} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1973018230|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1973018230, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1973018230, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1973018230, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1973018230} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 20:19:51,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P2Thread1of1ForFork1_#t~ite14_34| v_~y$r_buff1_thd3~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_33|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 20:19:51,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1068621965 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1068621965 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite5_Out-1068621965| 0)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1068621965 |P1Thread1of1ForFork0_#t~ite5_Out-1068621965|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1068621965, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1068621965} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1068621965, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1068621965, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out-1068621965|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 20:19:51,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-47123031 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-47123031 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-47123031 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-47123031 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite6_Out-47123031| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite6_Out-47123031| ~y$w_buff1_used~0_In-47123031) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-47123031, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-47123031, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-47123031, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-47123031} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-47123031, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-47123031, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-47123031, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out-47123031|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-47123031} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 20:19:51,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In270633347 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In270633347 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In270633347 |P1Thread1of1ForFork0_#t~ite7_Out270633347|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite7_Out270633347|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In270633347, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In270633347} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In270633347, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In270633347, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out270633347|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 20:19:51,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-558944640 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-558944640 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-558944640 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-558944640 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite8_Out-558944640|)) (and (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In-558944640 |P1Thread1of1ForFork0_#t~ite8_Out-558944640|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-558944640, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-558944640, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-558944640, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-558944640} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-558944640, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-558944640, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-558944640, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out-558944640|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-558944640} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 20:19:51,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= v_~y$r_buff1_thd2~0_82 |v_P1Thread1of1ForFork0_#t~ite8_36|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_36|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_82, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_35|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 20:19:51,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_253 256)) (= (mod v_~y$r_buff0_thd0~0_142 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 20:19:51,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In471443917 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out471443917| |ULTIMATE.start_main_#t~ite18_Out471443917|)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In471443917 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~y~0_In471443917 |ULTIMATE.start_main_#t~ite18_Out471443917|)) (and (not .cse0) .cse2 (not .cse1) (= ~y$w_buff1~0_In471443917 |ULTIMATE.start_main_#t~ite18_Out471443917|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In471443917, ~y~0=~y~0_In471443917, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In471443917, ~y$w_buff1_used~0=~y$w_buff1_used~0_In471443917} OutVars{~y$w_buff1~0=~y$w_buff1~0_In471443917, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out471443917|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out471443917|, ~y~0=~y~0_In471443917, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In471443917, ~y$w_buff1_used~0=~y$w_buff1_used~0_In471443917} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-07 20:19:51,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1862558722 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1862558722 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out-1862558722| ~y$w_buff0_used~0_In-1862558722)) (and (= |ULTIMATE.start_main_#t~ite20_Out-1862558722| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1862558722, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1862558722} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1862558722, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1862558722, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1862558722|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-07 20:19:51,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1494856955 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1494856955 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1494856955 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1494856955 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite21_Out-1494856955| 0)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1494856955 |ULTIMATE.start_main_#t~ite21_Out-1494856955|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1494856955, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1494856955, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1494856955, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1494856955} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1494856955, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1494856955, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1494856955|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1494856955, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1494856955} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-07 20:19:51,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1449172342 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1449172342 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite22_Out1449172342|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite22_Out1449172342| ~y$r_buff0_thd0~0_In1449172342)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1449172342, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1449172342} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1449172342, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1449172342, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1449172342|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-07 20:19:51,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1814525626 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1814525626 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1814525626 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1814525626 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite23_Out-1814525626| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite23_Out-1814525626| ~y$r_buff1_thd0~0_In-1814525626) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1814525626, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1814525626, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1814525626, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1814525626} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1814525626, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1814525626, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1814525626, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1814525626|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1814525626} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-07 20:19:51,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L834-->L834-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-81912080 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_In-81912080| |ULTIMATE.start_main_#t~ite29_Out-81912080|) (not .cse0) (= |ULTIMATE.start_main_#t~ite30_Out-81912080| ~y$w_buff0~0_In-81912080)) (and .cse0 (= ~y$w_buff0~0_In-81912080 |ULTIMATE.start_main_#t~ite29_Out-81912080|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-81912080 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-81912080 256) 0)) (= (mod ~y$w_buff0_used~0_In-81912080 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-81912080 256) 0)))) (= |ULTIMATE.start_main_#t~ite30_Out-81912080| |ULTIMATE.start_main_#t~ite29_Out-81912080|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-81912080, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-81912080|, ~y$w_buff0~0=~y$w_buff0~0_In-81912080, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-81912080, ~weak$$choice2~0=~weak$$choice2~0_In-81912080, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-81912080, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-81912080} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-81912080|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-81912080, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-81912080|, ~y$w_buff0~0=~y$w_buff0~0_In-81912080, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-81912080, ~weak$$choice2~0=~weak$$choice2~0_In-81912080, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-81912080, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-81912080} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-07 20:19:51,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L836-->L836-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In494766611 256) 0))) (or (and (= ~y$w_buff0_used~0_In494766611 |ULTIMATE.start_main_#t~ite35_Out494766611|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In494766611 256)))) (or (and (= (mod ~y$w_buff1_used~0_In494766611 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In494766611 256))) (= (mod ~y$w_buff0_used~0_In494766611 256) 0))) (= |ULTIMATE.start_main_#t~ite36_Out494766611| |ULTIMATE.start_main_#t~ite35_Out494766611|)) (and (not .cse0) (= ~y$w_buff0_used~0_In494766611 |ULTIMATE.start_main_#t~ite36_Out494766611|) (= |ULTIMATE.start_main_#t~ite35_In494766611| |ULTIMATE.start_main_#t~ite35_Out494766611|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In494766611, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In494766611, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In494766611|, ~weak$$choice2~0=~weak$$choice2~0_In494766611, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In494766611, ~y$w_buff1_used~0=~y$w_buff1_used~0_In494766611} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In494766611, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In494766611, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out494766611|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out494766611|, ~weak$$choice2~0=~weak$$choice2~0_In494766611, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In494766611, ~y$w_buff1_used~0=~y$w_buff1_used~0_In494766611} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 20:19:51,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-->L837-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-53880836 256)))) (or (and (not .cse0) (= ~y$w_buff1_used~0_In-53880836 |ULTIMATE.start_main_#t~ite39_Out-53880836|) (= |ULTIMATE.start_main_#t~ite38_In-53880836| |ULTIMATE.start_main_#t~ite38_Out-53880836|)) (and (= |ULTIMATE.start_main_#t~ite39_Out-53880836| |ULTIMATE.start_main_#t~ite38_Out-53880836|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-53880836 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-53880836 256)) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-53880836 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-53880836 256) 0)))) (= ~y$w_buff1_used~0_In-53880836 |ULTIMATE.start_main_#t~ite38_Out-53880836|) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-53880836, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-53880836, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-53880836|, ~weak$$choice2~0=~weak$$choice2~0_In-53880836, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-53880836, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-53880836} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-53880836, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-53880836|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-53880836, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-53880836|, ~weak$$choice2~0=~weak$$choice2~0_In-53880836, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-53880836, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-53880836} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 20:19:51,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd0~0_108 v_~y$r_buff0_thd0~0_107)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 20:19:51,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L839-->L839-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-402265928 256)))) (or (and (not .cse0) (= ~y$r_buff1_thd0~0_In-402265928 |ULTIMATE.start_main_#t~ite45_Out-402265928|) (= |ULTIMATE.start_main_#t~ite44_In-402265928| |ULTIMATE.start_main_#t~ite44_Out-402265928|)) (and (= ~y$r_buff1_thd0~0_In-402265928 |ULTIMATE.start_main_#t~ite44_Out-402265928|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-402265928 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-402265928 256))) (= 0 (mod ~y$w_buff0_used~0_In-402265928 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-402265928 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite44_Out-402265928| |ULTIMATE.start_main_#t~ite45_Out-402265928|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-402265928, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-402265928, ~weak$$choice2~0=~weak$$choice2~0_In-402265928, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-402265928, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-402265928, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-402265928|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-402265928, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-402265928, ~weak$$choice2~0=~weak$$choice2~0_In-402265928, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-402265928, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-402265928|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-402265928|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-402265928} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 20:19:51,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L841-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_27) (= v_~y~0_103 v_~y$mem_tmp~0_13) (not (= 0 (mod v_~y$flush_delayed~0_28 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y~0=v_~y~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:19:51,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 20:19:51,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:19:51 BasicIcfg [2019-12-07 20:19:51,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:19:51,574 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:19:51,574 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:19:51,574 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:19:51,574 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:19:40" (3/4) ... [2019-12-07 20:19:51,576 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 20:19:51,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~y$w_buff0_used~0_565 0) (= v_~y$w_buff1_used~0_304 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1114~0.base_27|) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff0_thd0~0_292 0) (= 0 v_~weak$$choice2~0_82) (= 0 v_~y$read_delayed_var~0.offset_8) (= (select .cse0 |v_ULTIMATE.start_main_~#t1114~0.base_27|) 0) (= 0 v_~__unbuffered_cnt~0_94) (= 0 v_~y$r_buff1_thd3~0_89) (= v_~y$read_delayed~0_8 0) (= 0 v_~y$r_buff1_thd2~0_113) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1114~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1114~0.base_27|) |v_ULTIMATE.start_main_~#t1114~0.offset_21| 0)) |v_#memory_int_15|) (= v_~main$tmp_guard1~0_30 0) (= v_~x~0_51 0) (= v_~y$w_buff1~0_136 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1114~0.base_27| 4)) (= 0 v_~y$r_buff0_thd2~0_108) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd1~0_41 0) (= 0 |v_ULTIMATE.start_main_~#t1114~0.offset_21|) (= v_~a~0_57 0) (= v_~y$mem_tmp~0_17 0) (= v_~z~0_41 0) (= 0 v_~y$r_buff1_thd1~0_40) (= v_~__unbuffered_p2_EBX~0_54 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t1114~0.base_27| 1)) (= v_~y~0_123 0) (= v_~y$r_buff1_thd0~0_196 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd3~0_130) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p0_EAX~0_39) (= 0 v_~weak$$choice0~0_13) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_34) (= 0 v_~y$w_buff0~0_162))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1114~0.offset=|v_ULTIMATE.start_main_~#t1114~0.offset_21|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_51|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_50|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_57, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_89, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_34, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ULTIMATE.start_main_~#t1115~0.base=|v_ULTIMATE.start_main_~#t1115~0.base_26|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_116|, ULTIMATE.start_main_~#t1116~0.offset=|v_ULTIMATE.start_main_~#t1116~0.offset_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_25|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_136, ULTIMATE.start_main_~#t1116~0.base=|v_ULTIMATE.start_main_~#t1116~0.base_21|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_~#t1115~0.offset=|v_ULTIMATE.start_main_~#t1115~0.offset_20|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_196, ~x~0=v_~x~0_51, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_565, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_34|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_49|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_31|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_27|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_27|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_28|, ~y$w_buff0~0=v_~y$w_buff0~0_162, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_130, ~y~0=v_~y~0_123, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_32|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_196|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_110|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_292, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1114~0.base=|v_ULTIMATE.start_main_~#t1114~0.base_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_41, ~weak$$choice2~0=v_~weak$$choice2~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_304} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1114~0.offset, ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1115~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1116~0.offset, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t1116~0.base, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1115~0.offset, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t1114~0.base, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 20:19:51,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1115~0.base_9| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1115~0.base_9|) (= |v_ULTIMATE.start_main_~#t1115~0.offset_8| 0) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1115~0.base_9|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1115~0.base_9| 1)) (not (= |v_ULTIMATE.start_main_~#t1115~0.base_9| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1115~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1115~0.base_9|) |v_ULTIMATE.start_main_~#t1115~0.offset_8| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~#t1115~0.offset=|v_ULTIMATE.start_main_~#t1115~0.offset_8|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1115~0.base=|v_ULTIMATE.start_main_~#t1115~0.base_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1115~0.offset, #length, ULTIMATE.start_main_~#t1115~0.base] because there is no mapped edge [2019-12-07 20:19:51,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1116~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1116~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1116~0.offset_10| 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1116~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1116~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1116~0.base_10|) |v_ULTIMATE.start_main_~#t1116~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1116~0.base_10| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1116~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1116~0.base=|v_ULTIMATE.start_main_~#t1116~0.base_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1116~0.offset=|v_ULTIMATE.start_main_~#t1116~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1116~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1116~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-07 20:19:51,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L4-->L789: Formula: (and (= ~y$r_buff0_thd3~0_In-2128820244 ~y$r_buff1_thd3~0_Out-2128820244) (= ~a~0_In-2128820244 ~__unbuffered_p2_EBX~0_Out-2128820244) (= ~y$r_buff0_thd3~0_Out-2128820244 1) (= ~y$r_buff1_thd0~0_Out-2128820244 ~y$r_buff0_thd0~0_In-2128820244) (= ~__unbuffered_p2_EAX~0_Out-2128820244 ~z~0_Out-2128820244) (= ~y$r_buff1_thd1~0_Out-2128820244 ~y$r_buff0_thd1~0_In-2128820244) (not (= 0 P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-2128820244)) (= ~y$r_buff1_thd2~0_Out-2128820244 ~y$r_buff0_thd2~0_In-2128820244) (= ~z~0_Out-2128820244 1)) InVars {~a~0=~a~0_In-2128820244, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2128820244, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2128820244, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2128820244, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2128820244, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-2128820244} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out-2128820244, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-2128820244, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-2128820244, ~a~0=~a~0_In-2128820244, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-2128820244, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-2128820244, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-2128820244, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2128820244, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2128820244, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2128820244, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out-2128820244, ~z~0=~z~0_Out-2128820244, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-2128820244} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 20:19:51,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_8 |v_P0Thread1of1ForFork2_#in~arg.base_10|) (= v_~a~0_22 1) (= v_~x~0_29 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= v_P0Thread1of1ForFork2_~arg.offset_8 |v_P0Thread1of1ForFork2_#in~arg.offset_10|) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~x~0=v_~x~0_29} OutVars{~a~0=v_~a~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_8, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, ~x~0=v_~x~0_29, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_8} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 20:19:51,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite3_Out1479466825| |P1Thread1of1ForFork0_#t~ite4_Out1479466825|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1479466825 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1479466825 256)))) (or (and (= ~y$w_buff1~0_In1479466825 |P1Thread1of1ForFork0_#t~ite3_Out1479466825|) .cse0 (not .cse1) (not .cse2)) (and .cse0 (= |P1Thread1of1ForFork0_#t~ite3_Out1479466825| ~y~0_In1479466825) (or .cse2 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1479466825, ~y$w_buff1~0=~y$w_buff1~0_In1479466825, ~y~0=~y~0_In1479466825, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1479466825} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1479466825, ~y$w_buff1~0=~y$w_buff1~0_In1479466825, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out1479466825|, ~y~0=~y~0_In1479466825, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out1479466825|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1479466825} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 20:19:51,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-369749280 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-369749280 256)))) (or (and (= ~y$w_buff0_used~0_In-369749280 |P2Thread1of1ForFork1_#t~ite11_Out-369749280|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite11_Out-369749280|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-369749280, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-369749280} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-369749280, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-369749280|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-369749280} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 20:19:51,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-237413785 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-237413785 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-237413785 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-237413785 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite12_Out-237413785| ~y$w_buff1_used~0_In-237413785)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork1_#t~ite12_Out-237413785| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-237413785, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-237413785, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-237413785, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-237413785} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-237413785, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-237413785, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-237413785, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-237413785|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-237413785} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 20:19:51,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2116707585 256))) (.cse2 (= ~y$r_buff0_thd3~0_Out2116707585 ~y$r_buff0_thd3~0_In2116707585)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In2116707585 256)))) (or (and (= 0 ~y$r_buff0_thd3~0_Out2116707585) (not .cse0) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2116707585, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2116707585} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out2116707585|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2116707585, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out2116707585} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 20:19:51,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1973018230 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1973018230 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1973018230 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1973018230 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite14_Out1973018230| ~y$r_buff1_thd3~0_In1973018230) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite14_Out1973018230| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1973018230, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1973018230, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1973018230, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1973018230} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1973018230|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1973018230, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1973018230, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1973018230, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1973018230} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 20:19:51,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P2Thread1of1ForFork1_#t~ite14_34| v_~y$r_buff1_thd3~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_33|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 20:19:51,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1068621965 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1068621965 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite5_Out-1068621965| 0)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1068621965 |P1Thread1of1ForFork0_#t~ite5_Out-1068621965|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1068621965, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1068621965} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1068621965, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1068621965, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out-1068621965|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 20:19:51,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-47123031 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-47123031 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-47123031 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-47123031 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite6_Out-47123031| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite6_Out-47123031| ~y$w_buff1_used~0_In-47123031) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-47123031, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-47123031, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-47123031, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-47123031} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-47123031, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-47123031, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-47123031, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out-47123031|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-47123031} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 20:19:51,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In270633347 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In270633347 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In270633347 |P1Thread1of1ForFork0_#t~ite7_Out270633347|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite7_Out270633347|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In270633347, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In270633347} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In270633347, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In270633347, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out270633347|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 20:19:51,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-558944640 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-558944640 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-558944640 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-558944640 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite8_Out-558944640|)) (and (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In-558944640 |P1Thread1of1ForFork0_#t~ite8_Out-558944640|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-558944640, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-558944640, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-558944640, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-558944640} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-558944640, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-558944640, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-558944640, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out-558944640|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-558944640} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 20:19:51,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= v_~y$r_buff1_thd2~0_82 |v_P1Thread1of1ForFork0_#t~ite8_36|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_36|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_82, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_35|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 20:19:51,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_253 256)) (= (mod v_~y$r_buff0_thd0~0_142 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 20:19:51,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In471443917 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out471443917| |ULTIMATE.start_main_#t~ite18_Out471443917|)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In471443917 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~y~0_In471443917 |ULTIMATE.start_main_#t~ite18_Out471443917|)) (and (not .cse0) .cse2 (not .cse1) (= ~y$w_buff1~0_In471443917 |ULTIMATE.start_main_#t~ite18_Out471443917|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In471443917, ~y~0=~y~0_In471443917, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In471443917, ~y$w_buff1_used~0=~y$w_buff1_used~0_In471443917} OutVars{~y$w_buff1~0=~y$w_buff1~0_In471443917, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out471443917|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out471443917|, ~y~0=~y~0_In471443917, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In471443917, ~y$w_buff1_used~0=~y$w_buff1_used~0_In471443917} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-07 20:19:51,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1862558722 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1862558722 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out-1862558722| ~y$w_buff0_used~0_In-1862558722)) (and (= |ULTIMATE.start_main_#t~ite20_Out-1862558722| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1862558722, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1862558722} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1862558722, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1862558722, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1862558722|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-07 20:19:51,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1494856955 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1494856955 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1494856955 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1494856955 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite21_Out-1494856955| 0)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1494856955 |ULTIMATE.start_main_#t~ite21_Out-1494856955|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1494856955, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1494856955, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1494856955, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1494856955} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1494856955, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1494856955, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1494856955|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1494856955, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1494856955} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-07 20:19:51,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1449172342 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1449172342 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite22_Out1449172342|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite22_Out1449172342| ~y$r_buff0_thd0~0_In1449172342)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1449172342, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1449172342} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1449172342, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1449172342, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1449172342|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-07 20:19:51,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1814525626 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1814525626 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1814525626 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1814525626 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite23_Out-1814525626| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite23_Out-1814525626| ~y$r_buff1_thd0~0_In-1814525626) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1814525626, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1814525626, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1814525626, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1814525626} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1814525626, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1814525626, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1814525626, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1814525626|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1814525626} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-07 20:19:51,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L834-->L834-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-81912080 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_In-81912080| |ULTIMATE.start_main_#t~ite29_Out-81912080|) (not .cse0) (= |ULTIMATE.start_main_#t~ite30_Out-81912080| ~y$w_buff0~0_In-81912080)) (and .cse0 (= ~y$w_buff0~0_In-81912080 |ULTIMATE.start_main_#t~ite29_Out-81912080|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-81912080 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-81912080 256) 0)) (= (mod ~y$w_buff0_used~0_In-81912080 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-81912080 256) 0)))) (= |ULTIMATE.start_main_#t~ite30_Out-81912080| |ULTIMATE.start_main_#t~ite29_Out-81912080|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-81912080, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-81912080|, ~y$w_buff0~0=~y$w_buff0~0_In-81912080, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-81912080, ~weak$$choice2~0=~weak$$choice2~0_In-81912080, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-81912080, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-81912080} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-81912080|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-81912080, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-81912080|, ~y$w_buff0~0=~y$w_buff0~0_In-81912080, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-81912080, ~weak$$choice2~0=~weak$$choice2~0_In-81912080, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-81912080, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-81912080} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-07 20:19:51,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L836-->L836-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In494766611 256) 0))) (or (and (= ~y$w_buff0_used~0_In494766611 |ULTIMATE.start_main_#t~ite35_Out494766611|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In494766611 256)))) (or (and (= (mod ~y$w_buff1_used~0_In494766611 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In494766611 256))) (= (mod ~y$w_buff0_used~0_In494766611 256) 0))) (= |ULTIMATE.start_main_#t~ite36_Out494766611| |ULTIMATE.start_main_#t~ite35_Out494766611|)) (and (not .cse0) (= ~y$w_buff0_used~0_In494766611 |ULTIMATE.start_main_#t~ite36_Out494766611|) (= |ULTIMATE.start_main_#t~ite35_In494766611| |ULTIMATE.start_main_#t~ite35_Out494766611|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In494766611, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In494766611, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In494766611|, ~weak$$choice2~0=~weak$$choice2~0_In494766611, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In494766611, ~y$w_buff1_used~0=~y$w_buff1_used~0_In494766611} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In494766611, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In494766611, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out494766611|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out494766611|, ~weak$$choice2~0=~weak$$choice2~0_In494766611, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In494766611, ~y$w_buff1_used~0=~y$w_buff1_used~0_In494766611} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 20:19:51,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-->L837-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-53880836 256)))) (or (and (not .cse0) (= ~y$w_buff1_used~0_In-53880836 |ULTIMATE.start_main_#t~ite39_Out-53880836|) (= |ULTIMATE.start_main_#t~ite38_In-53880836| |ULTIMATE.start_main_#t~ite38_Out-53880836|)) (and (= |ULTIMATE.start_main_#t~ite39_Out-53880836| |ULTIMATE.start_main_#t~ite38_Out-53880836|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-53880836 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-53880836 256)) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-53880836 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-53880836 256) 0)))) (= ~y$w_buff1_used~0_In-53880836 |ULTIMATE.start_main_#t~ite38_Out-53880836|) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-53880836, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-53880836, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-53880836|, ~weak$$choice2~0=~weak$$choice2~0_In-53880836, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-53880836, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-53880836} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-53880836, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-53880836|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-53880836, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-53880836|, ~weak$$choice2~0=~weak$$choice2~0_In-53880836, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-53880836, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-53880836} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 20:19:51,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd0~0_108 v_~y$r_buff0_thd0~0_107)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 20:19:51,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L839-->L839-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-402265928 256)))) (or (and (not .cse0) (= ~y$r_buff1_thd0~0_In-402265928 |ULTIMATE.start_main_#t~ite45_Out-402265928|) (= |ULTIMATE.start_main_#t~ite44_In-402265928| |ULTIMATE.start_main_#t~ite44_Out-402265928|)) (and (= ~y$r_buff1_thd0~0_In-402265928 |ULTIMATE.start_main_#t~ite44_Out-402265928|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-402265928 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-402265928 256))) (= 0 (mod ~y$w_buff0_used~0_In-402265928 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-402265928 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite44_Out-402265928| |ULTIMATE.start_main_#t~ite45_Out-402265928|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-402265928, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-402265928, ~weak$$choice2~0=~weak$$choice2~0_In-402265928, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-402265928, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-402265928, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-402265928|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-402265928, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-402265928, ~weak$$choice2~0=~weak$$choice2~0_In-402265928, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-402265928, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-402265928|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-402265928|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-402265928} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 20:19:51,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L841-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_27) (= v_~y~0_103 v_~y$mem_tmp~0_13) (not (= 0 (mod v_~y$flush_delayed~0_28 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y~0=v_~y~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:19:51,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 20:19:51,646 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_301fe163-514e-4fb8-8bc8-15404c76add9/bin/utaipan/witness.graphml [2019-12-07 20:19:51,646 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:19:51,647 INFO L168 Benchmark]: Toolchain (without parser) took 11586.08 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 542.1 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -128.1 MB). Peak memory consumption was 414.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:51,648 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:19:51,648 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -127.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:51,648 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:51,649 INFO L168 Benchmark]: Boogie Preprocessor took 24.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:19:51,649 INFO L168 Benchmark]: RCFGBuilder took 390.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:51,649 INFO L168 Benchmark]: TraceAbstraction took 10673.32 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 444.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -79.8 MB). Peak memory consumption was 364.8 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:51,650 INFO L168 Benchmark]: Witness Printer took 72.32 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:51,651 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 383.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -127.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 390.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10673.32 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 444.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -79.8 MB). Peak memory consumption was 364.8 MB. Max. memory is 11.5 GB. * Witness Printer took 72.32 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 86 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 28 ChoiceCompositions, 4263 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 192 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.6s, 0 MoverChecksTotal, 50142 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1114, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L814] FCALL, FORK 0 pthread_create(&t1115, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L816] FCALL, FORK 0 pthread_create(&t1116, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] 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) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=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=1] [L754] 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) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=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=1] [L754] 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) [L789] 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) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 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 [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 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 [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, 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=1] [L833] 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) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, 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=1] [L833] 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) [L834] 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)) [L835] 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, 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=1] [L835] 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)) [L836] 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)) [L837] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, 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=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.5s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1800 SDtfs, 2018 SDslu, 4155 SDs, 0 SdLazy, 2405 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 20 SyntacticMatches, 10 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17509occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 19068 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 559 NumberOfCodeBlocks, 559 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 487 ConstructedInterpolants, 0 QuantifiedInterpolants, 74309 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...