./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_power.oepc.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_a327e8b7-5cf9-4f1a-8f44-80ded124125c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a327e8b7-5cf9-4f1a-8f44-80ded124125c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a327e8b7-5cf9-4f1a-8f44-80ded124125c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a327e8b7-5cf9-4f1a-8f44-80ded124125c/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a327e8b7-5cf9-4f1a-8f44-80ded124125c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a327e8b7-5cf9-4f1a-8f44-80ded124125c/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 af9bad490e1b3d44d3264f2400e30d4a7d8beddf ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 14:04:28,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:04:28,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:04:28,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:04:28,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:04:28,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:04:28,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:04:28,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:04:28,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:04:28,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:04:28,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:04:28,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:04:28,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:04:28,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:04:28,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:04:28,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:04:28,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:04:28,122 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:04:28,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:04:28,125 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:04:28,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:04:28,127 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:04:28,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:04:28,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:04:28,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:04:28,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:04:28,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:04:28,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:04:28,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:04:28,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:04:28,132 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:04:28,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:04:28,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:04:28,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:04:28,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:04:28,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:04:28,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:04:28,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:04:28,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:04:28,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:04:28,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:04:28,137 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a327e8b7-5cf9-4f1a-8f44-80ded124125c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 14:04:28,150 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:04:28,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:04:28,151 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:04:28,151 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:04:28,152 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:04:28,152 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:04:28,152 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:04:28,152 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:04:28,152 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:04:28,152 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:04:28,153 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:04:28,153 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:04:28,153 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:04:28,153 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:04:28,153 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:04:28,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:04:28,154 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:04:28,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:04:28,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:04:28,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:04:28,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:04:28,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:04:28,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:04:28,155 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:04:28,156 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:04:28,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:04:28,156 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:04:28,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:04:28,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:04:28,156 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:04:28,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:04:28,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:04:28,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:04:28,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:04:28,157 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:04:28,157 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:04:28,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:04:28,158 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:04:28,158 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:04:28,158 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:04:28,158 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_a327e8b7-5cf9-4f1a-8f44-80ded124125c/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 -> af9bad490e1b3d44d3264f2400e30d4a7d8beddf [2019-12-07 14:04:28,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:04:28,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:04:28,276 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:04:28,277 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:04:28,278 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:04:28,278 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a327e8b7-5cf9-4f1a-8f44-80ded124125c/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi000_power.oepc.i [2019-12-07 14:04:28,325 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a327e8b7-5cf9-4f1a-8f44-80ded124125c/bin/utaipan/data/41acac9db/ac34e225c8864edaad2966a7e560e63d/FLAG5c5bcc1fb [2019-12-07 14:04:28,690 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:04:28,690 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a327e8b7-5cf9-4f1a-8f44-80ded124125c/sv-benchmarks/c/pthread-wmm/rfi000_power.oepc.i [2019-12-07 14:04:28,702 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a327e8b7-5cf9-4f1a-8f44-80ded124125c/bin/utaipan/data/41acac9db/ac34e225c8864edaad2966a7e560e63d/FLAG5c5bcc1fb [2019-12-07 14:04:28,711 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a327e8b7-5cf9-4f1a-8f44-80ded124125c/bin/utaipan/data/41acac9db/ac34e225c8864edaad2966a7e560e63d [2019-12-07 14:04:28,713 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:04:28,713 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:04:28,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:04:28,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:04:28,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:04:28,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:04:28" (1/1) ... [2019-12-07 14:04:28,719 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 02:04:28, skipping insertion in model container [2019-12-07 14:04:28,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:04:28" (1/1) ... [2019-12-07 14:04:28,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:04:28,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:04:29,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:04:29,022 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:04:29,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:04:29,115 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:04:29,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:29 WrapperNode [2019-12-07 14:04:29,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:04:29,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:04:29,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:04:29,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:04:29,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:29" (1/1) ... [2019-12-07 14:04:29,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:29" (1/1) ... [2019-12-07 14:04:29,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:04:29,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:04:29,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:04:29,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:04:29,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:29" (1/1) ... [2019-12-07 14:04:29,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:29" (1/1) ... [2019-12-07 14:04:29,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:29" (1/1) ... [2019-12-07 14:04:29,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:29" (1/1) ... [2019-12-07 14:04:29,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:29" (1/1) ... [2019-12-07 14:04:29,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:29" (1/1) ... [2019-12-07 14:04:29,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:29" (1/1) ... [2019-12-07 14:04:29,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:04:29,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:04:29,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:04:29,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:04:29,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a327e8b7-5cf9-4f1a-8f44-80ded124125c/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 14:04:29,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:04:29,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:04:29,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:04:29,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:04:29,235 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:04:29,235 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:04:29,235 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:04:29,235 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:04:29,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:04:29,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:04:29,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:04:29,237 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 14:04:29,716 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:04:29,716 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:04:29,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:04:29 BoogieIcfgContainer [2019-12-07 14:04:29,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:04:29,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:04:29,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:04:29,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:04:29,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:04:28" (1/3) ... [2019-12-07 14:04:29,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc0b05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:04:29, skipping insertion in model container [2019-12-07 14:04:29,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:29" (2/3) ... [2019-12-07 14:04:29,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc0b05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:04:29, skipping insertion in model container [2019-12-07 14:04:29,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:04:29" (3/3) ... [2019-12-07 14:04:29,722 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_power.oepc.i [2019-12-07 14:04:29,728 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:04:29,728 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:04:29,733 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:04:29,734 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:04:29,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,761 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,761 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,761 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,762 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,762 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,766 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,767 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:29,796 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 14:04:29,810 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:04:29,810 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:04:29,810 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:04:29,810 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:04:29,810 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:04:29,810 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:04:29,810 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:04:29,810 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:04:29,823 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 307 transitions [2019-12-07 14:04:29,824 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-07 14:04:29,904 INFO L134 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-07 14:04:29,904 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:04:29,921 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1205 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-07 14:04:29,961 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-07 14:04:30,014 INFO L134 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-07 14:04:30,015 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:04:30,028 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1205 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-07 14:04:30,061 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 41414 [2019-12-07 14:04:30,062 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:04:33,703 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 14:04:33,820 INFO L206 etLargeBlockEncoding]: Checked pairs total: 238871 [2019-12-07 14:04:33,820 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-07 14:04:33,823 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 150 places, 186 transitions [2019-12-07 14:04:37,267 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 55330 states. [2019-12-07 14:04:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand 55330 states. [2019-12-07 14:04:37,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 14:04:37,273 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:37,273 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 14:04:37,273 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:37,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:37,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1316112, now seen corresponding path program 1 times [2019-12-07 14:04:37,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:37,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911919045] [2019-12-07 14:04:37,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:37,426 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 14:04:37,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911919045] [2019-12-07 14:04:37,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:37,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:04:37,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755012207] [2019-12-07 14:04:37,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:04:37,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:37,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:04:37,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:04:37,441 INFO L87 Difference]: Start difference. First operand 55330 states. Second operand 3 states. [2019-12-07 14:04:37,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:37,963 INFO L93 Difference]: Finished difference Result 55134 states and 195732 transitions. [2019-12-07 14:04:37,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:04:37,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 14:04:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:38,250 INFO L225 Difference]: With dead ends: 55134 [2019-12-07 14:04:38,250 INFO L226 Difference]: Without dead ends: 54186 [2019-12-07 14:04:38,251 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 14:04:39,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54186 states. [2019-12-07 14:04:39,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54186 to 54186. [2019-12-07 14:04:39,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54186 states. [2019-12-07 14:04:40,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54186 states to 54186 states and 192533 transitions. [2019-12-07 14:04:40,071 INFO L78 Accepts]: Start accepts. Automaton has 54186 states and 192533 transitions. Word has length 3 [2019-12-07 14:04:40,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:40,071 INFO L462 AbstractCegarLoop]: Abstraction has 54186 states and 192533 transitions. [2019-12-07 14:04:40,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:04:40,072 INFO L276 IsEmpty]: Start isEmpty. Operand 54186 states and 192533 transitions. [2019-12-07 14:04:40,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:04:40,074 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:40,074 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:40,074 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:40,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:40,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1209114037, now seen corresponding path program 1 times [2019-12-07 14:04:40,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:40,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396225699] [2019-12-07 14:04:40,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:40,140 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 14:04:40,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396225699] [2019-12-07 14:04:40,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:40,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:04:40,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901838258] [2019-12-07 14:04:40,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:04:40,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:40,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:04:40,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:04:40,142 INFO L87 Difference]: Start difference. First operand 54186 states and 192533 transitions. Second operand 4 states. [2019-12-07 14:04:40,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:40,242 INFO L93 Difference]: Finished difference Result 6606 states and 17259 transitions. [2019-12-07 14:04:40,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:04:40,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 14:04:40,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:40,260 INFO L225 Difference]: With dead ends: 6606 [2019-12-07 14:04:40,260 INFO L226 Difference]: Without dead ends: 5658 [2019-12-07 14:04:40,261 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 14:04:40,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5658 states. [2019-12-07 14:04:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5658 to 5658. [2019-12-07 14:04:40,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5658 states. [2019-12-07 14:04:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5658 states to 5658 states and 14157 transitions. [2019-12-07 14:04:40,463 INFO L78 Accepts]: Start accepts. Automaton has 5658 states and 14157 transitions. Word has length 11 [2019-12-07 14:04:40,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:40,463 INFO L462 AbstractCegarLoop]: Abstraction has 5658 states and 14157 transitions. [2019-12-07 14:04:40,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:04:40,463 INFO L276 IsEmpty]: Start isEmpty. Operand 5658 states and 14157 transitions. [2019-12-07 14:04:40,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:04:40,465 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:40,465 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:40,465 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:40,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:40,465 INFO L82 PathProgramCache]: Analyzing trace with hash 196484102, now seen corresponding path program 1 times [2019-12-07 14:04:40,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:40,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788035623] [2019-12-07 14:04:40,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:40,531 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 14:04:40,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788035623] [2019-12-07 14:04:40,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:40,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:04:40,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915569621] [2019-12-07 14:04:40,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:04:40,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:40,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:04:40,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:04:40,533 INFO L87 Difference]: Start difference. First operand 5658 states and 14157 transitions. Second operand 4 states. [2019-12-07 14:04:40,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:40,737 INFO L93 Difference]: Finished difference Result 7256 states and 17796 transitions. [2019-12-07 14:04:40,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:04:40,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:04:40,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:40,744 INFO L225 Difference]: With dead ends: 7256 [2019-12-07 14:04:40,744 INFO L226 Difference]: Without dead ends: 7256 [2019-12-07 14:04:40,744 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 14:04:40,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7256 states. [2019-12-07 14:04:40,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7256 to 7222. [2019-12-07 14:04:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7222 states. [2019-12-07 14:04:40,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7222 states to 7222 states and 17730 transitions. [2019-12-07 14:04:40,841 INFO L78 Accepts]: Start accepts. Automaton has 7222 states and 17730 transitions. Word has length 14 [2019-12-07 14:04:40,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:40,842 INFO L462 AbstractCegarLoop]: Abstraction has 7222 states and 17730 transitions. [2019-12-07 14:04:40,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:04:40,842 INFO L276 IsEmpty]: Start isEmpty. Operand 7222 states and 17730 transitions. [2019-12-07 14:04:40,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 14:04:40,847 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:40,847 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] [2019-12-07 14:04:40,847 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:40,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:40,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1725930936, now seen corresponding path program 1 times [2019-12-07 14:04:40,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:40,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598895444] [2019-12-07 14:04:40,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:40,933 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 14:04:40,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598895444] [2019-12-07 14:04:40,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:40,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:04:40,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637809311] [2019-12-07 14:04:40,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:04:40,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:40,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:04:40,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:04:40,935 INFO L87 Difference]: Start difference. First operand 7222 states and 17730 transitions. Second operand 5 states. [2019-12-07 14:04:41,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:41,281 INFO L93 Difference]: Finished difference Result 8308 states and 20180 transitions. [2019-12-07 14:04:41,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:04:41,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 14:04:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:41,288 INFO L225 Difference]: With dead ends: 8308 [2019-12-07 14:04:41,288 INFO L226 Difference]: Without dead ends: 8308 [2019-12-07 14:04:41,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:04:41,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8308 states. [2019-12-07 14:04:41,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8308 to 8206. [2019-12-07 14:04:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8206 states. [2019-12-07 14:04:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8206 states to 8206 states and 19982 transitions. [2019-12-07 14:04:41,384 INFO L78 Accepts]: Start accepts. Automaton has 8206 states and 19982 transitions. Word has length 30 [2019-12-07 14:04:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:41,385 INFO L462 AbstractCegarLoop]: Abstraction has 8206 states and 19982 transitions. [2019-12-07 14:04:41,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:04:41,385 INFO L276 IsEmpty]: Start isEmpty. Operand 8206 states and 19982 transitions. [2019-12-07 14:04:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 14:04:41,387 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:41,387 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] [2019-12-07 14:04:41,387 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:41,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:41,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1964223061, now seen corresponding path program 1 times [2019-12-07 14:04:41,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:41,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497315258] [2019-12-07 14:04:41,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:41,422 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 14:04:41,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497315258] [2019-12-07 14:04:41,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:41,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:04:41,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514513702] [2019-12-07 14:04:41,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:04:41,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:41,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:04:41,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:04:41,423 INFO L87 Difference]: Start difference. First operand 8206 states and 19982 transitions. Second operand 3 states. [2019-12-07 14:04:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:41,510 INFO L93 Difference]: Finished difference Result 12335 states and 28548 transitions. [2019-12-07 14:04:41,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:04:41,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 14:04:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:41,522 INFO L225 Difference]: With dead ends: 12335 [2019-12-07 14:04:41,522 INFO L226 Difference]: Without dead ends: 12335 [2019-12-07 14:04:41,522 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 14:04:41,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12335 states. [2019-12-07 14:04:41,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12335 to 11324. [2019-12-07 14:04:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11324 states. [2019-12-07 14:04:41,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11324 states to 11324 states and 26462 transitions. [2019-12-07 14:04:41,646 INFO L78 Accepts]: Start accepts. Automaton has 11324 states and 26462 transitions. Word has length 31 [2019-12-07 14:04:41,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:41,646 INFO L462 AbstractCegarLoop]: Abstraction has 11324 states and 26462 transitions. [2019-12-07 14:04:41,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:04:41,647 INFO L276 IsEmpty]: Start isEmpty. Operand 11324 states and 26462 transitions. [2019-12-07 14:04:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 14:04:41,649 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:41,650 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] [2019-12-07 14:04:41,650 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:41,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:41,650 INFO L82 PathProgramCache]: Analyzing trace with hash -71378589, now seen corresponding path program 1 times [2019-12-07 14:04:41,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:41,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509013095] [2019-12-07 14:04:41,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:41,708 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 14:04:41,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509013095] [2019-12-07 14:04:41,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:41,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:04:41,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419798447] [2019-12-07 14:04:41,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:04:41,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:41,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:04:41,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:04:41,710 INFO L87 Difference]: Start difference. First operand 11324 states and 26462 transitions. Second operand 5 states. [2019-12-07 14:04:42,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:42,029 INFO L93 Difference]: Finished difference Result 12877 states and 29790 transitions. [2019-12-07 14:04:42,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:04:42,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 14:04:42,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:42,041 INFO L225 Difference]: With dead ends: 12877 [2019-12-07 14:04:42,041 INFO L226 Difference]: Without dead ends: 12877 [2019-12-07 14:04:42,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:04:42,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12877 states. [2019-12-07 14:04:42,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12877 to 11566. [2019-12-07 14:04:42,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11566 states. [2019-12-07 14:04:42,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11566 states to 11566 states and 27002 transitions. [2019-12-07 14:04:42,222 INFO L78 Accepts]: Start accepts. Automaton has 11566 states and 27002 transitions. Word has length 33 [2019-12-07 14:04:42,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:42,222 INFO L462 AbstractCegarLoop]: Abstraction has 11566 states and 27002 transitions. [2019-12-07 14:04:42,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:04:42,222 INFO L276 IsEmpty]: Start isEmpty. Operand 11566 states and 27002 transitions. [2019-12-07 14:04:42,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:04:42,228 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:42,228 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] [2019-12-07 14:04:42,228 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:42,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:42,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1192698792, now seen corresponding path program 1 times [2019-12-07 14:04:42,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:42,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589788505] [2019-12-07 14:04:42,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:42,307 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 14:04:42,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589788505] [2019-12-07 14:04:42,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:42,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:04:42,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576046329] [2019-12-07 14:04:42,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:04:42,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:42,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:04:42,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:04:42,309 INFO L87 Difference]: Start difference. First operand 11566 states and 27002 transitions. Second operand 5 states. [2019-12-07 14:04:42,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:42,444 INFO L93 Difference]: Finished difference Result 12422 states and 28901 transitions. [2019-12-07 14:04:42,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:04:42,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 14:04:42,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:42,454 INFO L225 Difference]: With dead ends: 12422 [2019-12-07 14:04:42,454 INFO L226 Difference]: Without dead ends: 12060 [2019-12-07 14:04:42,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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 14:04:42,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12060 states. [2019-12-07 14:04:42,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12060 to 11633. [2019-12-07 14:04:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11633 states. [2019-12-07 14:04:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 27076 transitions. [2019-12-07 14:04:42,579 INFO L78 Accepts]: Start accepts. Automaton has 11633 states and 27076 transitions. Word has length 42 [2019-12-07 14:04:42,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:42,579 INFO L462 AbstractCegarLoop]: Abstraction has 11633 states and 27076 transitions. [2019-12-07 14:04:42,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:04:42,580 INFO L276 IsEmpty]: Start isEmpty. Operand 11633 states and 27076 transitions. [2019-12-07 14:04:42,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 14:04:42,584 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:42,585 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] [2019-12-07 14:04:42,585 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:42,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:42,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1557518893, now seen corresponding path program 1 times [2019-12-07 14:04:42,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:42,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693991568] [2019-12-07 14:04:42,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:42,659 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 14:04:42,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693991568] [2019-12-07 14:04:42,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:42,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:04:42,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115969782] [2019-12-07 14:04:42,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:04:42,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:42,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:04:42,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:04:42,661 INFO L87 Difference]: Start difference. First operand 11633 states and 27076 transitions. Second operand 6 states. [2019-12-07 14:04:43,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:43,118 INFO L93 Difference]: Finished difference Result 13717 states and 31382 transitions. [2019-12-07 14:04:43,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:04:43,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-07 14:04:43,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:43,129 INFO L225 Difference]: With dead ends: 13717 [2019-12-07 14:04:43,129 INFO L226 Difference]: Without dead ends: 13692 [2019-12-07 14:04:43,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:04:43,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13692 states. [2019-12-07 14:04:43,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13692 to 12874. [2019-12-07 14:04:43,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12874 states. [2019-12-07 14:04:43,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12874 states to 12874 states and 29756 transitions. [2019-12-07 14:04:43,265 INFO L78 Accepts]: Start accepts. Automaton has 12874 states and 29756 transitions. Word has length 43 [2019-12-07 14:04:43,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:43,265 INFO L462 AbstractCegarLoop]: Abstraction has 12874 states and 29756 transitions. [2019-12-07 14:04:43,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:04:43,265 INFO L276 IsEmpty]: Start isEmpty. Operand 12874 states and 29756 transitions. [2019-12-07 14:04:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 14:04:43,271 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:43,271 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] [2019-12-07 14:04:43,271 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:43,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:43,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1777006862, now seen corresponding path program 1 times [2019-12-07 14:04:43,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:43,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342808590] [2019-12-07 14:04:43,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:43,298 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 14:04:43,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342808590] [2019-12-07 14:04:43,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:43,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:04:43,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135053450] [2019-12-07 14:04:43,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:04:43,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:43,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:04:43,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:04:43,300 INFO L87 Difference]: Start difference. First operand 12874 states and 29756 transitions. Second operand 3 states. [2019-12-07 14:04:43,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:43,401 INFO L93 Difference]: Finished difference Result 14139 states and 30703 transitions. [2019-12-07 14:04:43,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:04:43,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-12-07 14:04:43,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:43,416 INFO L225 Difference]: With dead ends: 14139 [2019-12-07 14:04:43,416 INFO L226 Difference]: Without dead ends: 14139 [2019-12-07 14:04:43,416 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 14:04:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14139 states. [2019-12-07 14:04:43,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14139 to 13323. [2019-12-07 14:04:43,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13323 states. [2019-12-07 14:04:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13323 states to 13323 states and 29038 transitions. [2019-12-07 14:04:43,563 INFO L78 Accepts]: Start accepts. Automaton has 13323 states and 29038 transitions. Word has length 46 [2019-12-07 14:04:43,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:43,563 INFO L462 AbstractCegarLoop]: Abstraction has 13323 states and 29038 transitions. [2019-12-07 14:04:43,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:04:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 13323 states and 29038 transitions. [2019-12-07 14:04:43,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 14:04:43,570 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:43,570 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] [2019-12-07 14:04:43,570 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:43,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:43,570 INFO L82 PathProgramCache]: Analyzing trace with hash -753849587, now seen corresponding path program 1 times [2019-12-07 14:04:43,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:43,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433072501] [2019-12-07 14:04:43,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:43,638 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 14:04:43,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433072501] [2019-12-07 14:04:43,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:43,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:04:43,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705043236] [2019-12-07 14:04:43,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:04:43,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:43,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:04:43,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:04:43,639 INFO L87 Difference]: Start difference. First operand 13323 states and 29038 transitions. Second operand 6 states. [2019-12-07 14:04:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:44,063 INFO L93 Difference]: Finished difference Result 14371 states and 31038 transitions. [2019-12-07 14:04:44,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:04:44,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-07 14:04:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:44,073 INFO L225 Difference]: With dead ends: 14371 [2019-12-07 14:04:44,073 INFO L226 Difference]: Without dead ends: 14303 [2019-12-07 14:04:44,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:04:44,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14303 states. [2019-12-07 14:04:44,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14303 to 12587. [2019-12-07 14:04:44,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12587 states. [2019-12-07 14:04:44,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12587 states to 12587 states and 27531 transitions. [2019-12-07 14:04:44,274 INFO L78 Accepts]: Start accepts. Automaton has 12587 states and 27531 transitions. Word has length 49 [2019-12-07 14:04:44,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:44,274 INFO L462 AbstractCegarLoop]: Abstraction has 12587 states and 27531 transitions. [2019-12-07 14:04:44,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:04:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 12587 states and 27531 transitions. [2019-12-07 14:04:44,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:04:44,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:44,283 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] [2019-12-07 14:04:44,284 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:44,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:44,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1658446064, now seen corresponding path program 1 times [2019-12-07 14:04:44,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:44,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744454641] [2019-12-07 14:04:44,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:44,366 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 14:04:44,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744454641] [2019-12-07 14:04:44,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:44,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:04:44,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086693129] [2019-12-07 14:04:44,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:04:44,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:44,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:04:44,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:04:44,368 INFO L87 Difference]: Start difference. First operand 12587 states and 27531 transitions. Second operand 7 states. [2019-12-07 14:04:44,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:44,932 INFO L93 Difference]: Finished difference Result 16744 states and 35845 transitions. [2019-12-07 14:04:44,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:04:44,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-07 14:04:44,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:44,945 INFO L225 Difference]: With dead ends: 16744 [2019-12-07 14:04:44,945 INFO L226 Difference]: Without dead ends: 16744 [2019-12-07 14:04:44,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:04:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16744 states. [2019-12-07 14:04:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16744 to 13935. [2019-12-07 14:04:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13935 states. [2019-12-07 14:04:45,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13935 states to 13935 states and 30306 transitions. [2019-12-07 14:04:45,102 INFO L78 Accepts]: Start accepts. Automaton has 13935 states and 30306 transitions. Word has length 55 [2019-12-07 14:04:45,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:45,102 INFO L462 AbstractCegarLoop]: Abstraction has 13935 states and 30306 transitions. [2019-12-07 14:04:45,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:04:45,102 INFO L276 IsEmpty]: Start isEmpty. Operand 13935 states and 30306 transitions. [2019-12-07 14:04:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 14:04:45,113 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:45,113 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 14:04:45,113 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:45,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:45,114 INFO L82 PathProgramCache]: Analyzing trace with hash 138224270, now seen corresponding path program 1 times [2019-12-07 14:04:45,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:45,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804934284] [2019-12-07 14:04:45,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:45,234 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 14:04:45,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804934284] [2019-12-07 14:04:45,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:45,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 14:04:45,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780549719] [2019-12-07 14:04:45,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 14:04:45,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:45,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 14:04:45,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:04:45,235 INFO L87 Difference]: Start difference. First operand 13935 states and 30306 transitions. Second operand 9 states. [2019-12-07 14:04:46,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:46,370 INFO L93 Difference]: Finished difference Result 32044 states and 70062 transitions. [2019-12-07 14:04:46,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 14:04:46,371 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-07 14:04:46,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:46,392 INFO L225 Difference]: With dead ends: 32044 [2019-12-07 14:04:46,392 INFO L226 Difference]: Without dead ends: 25079 [2019-12-07 14:04:46,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-12-07 14:04:46,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25079 states. [2019-12-07 14:04:46,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25079 to 15266. [2019-12-07 14:04:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15266 states. [2019-12-07 14:04:46,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15266 states to 15266 states and 33174 transitions. [2019-12-07 14:04:46,598 INFO L78 Accepts]: Start accepts. Automaton has 15266 states and 33174 transitions. Word has length 57 [2019-12-07 14:04:46,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:46,599 INFO L462 AbstractCegarLoop]: Abstraction has 15266 states and 33174 transitions. [2019-12-07 14:04:46,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 14:04:46,599 INFO L276 IsEmpty]: Start isEmpty. Operand 15266 states and 33174 transitions. [2019-12-07 14:04:46,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 14:04:46,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:46,612 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 14:04:46,612 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:46,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:46,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1742128242, now seen corresponding path program 2 times [2019-12-07 14:04:46,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:46,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101564513] [2019-12-07 14:04:46,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:46,659 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 14:04:46,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101564513] [2019-12-07 14:04:46,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:46,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:04:46,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573385428] [2019-12-07 14:04:46,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:04:46,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:46,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:04:46,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:04:46,661 INFO L87 Difference]: Start difference. First operand 15266 states and 33174 transitions. Second operand 5 states. [2019-12-07 14:04:46,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:46,694 INFO L93 Difference]: Finished difference Result 2908 states and 5866 transitions. [2019-12-07 14:04:46,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:04:46,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-07 14:04:46,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:46,696 INFO L225 Difference]: With dead ends: 2908 [2019-12-07 14:04:46,696 INFO L226 Difference]: Without dead ends: 2666 [2019-12-07 14:04:46,697 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 14:04:46,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2019-12-07 14:04:46,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2205. [2019-12-07 14:04:46,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2205 states. [2019-12-07 14:04:46,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 4426 transitions. [2019-12-07 14:04:46,716 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 4426 transitions. Word has length 57 [2019-12-07 14:04:46,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:46,716 INFO L462 AbstractCegarLoop]: Abstraction has 2205 states and 4426 transitions. [2019-12-07 14:04:46,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:04:46,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 4426 transitions. [2019-12-07 14:04:46,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 14:04:46,719 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:46,719 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, 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 14:04:46,719 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:46,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:46,719 INFO L82 PathProgramCache]: Analyzing trace with hash -253914571, now seen corresponding path program 1 times [2019-12-07 14:04:46,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:46,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813087747] [2019-12-07 14:04:46,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:46,781 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 14:04:46,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813087747] [2019-12-07 14:04:46,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:46,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:04:46,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545869669] [2019-12-07 14:04:46,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:04:46,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:46,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:04:46,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:04:46,783 INFO L87 Difference]: Start difference. First operand 2205 states and 4426 transitions. Second operand 5 states. [2019-12-07 14:04:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:47,013 INFO L93 Difference]: Finished difference Result 2336 states and 4664 transitions. [2019-12-07 14:04:47,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:04:47,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-12-07 14:04:47,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:47,015 INFO L225 Difference]: With dead ends: 2336 [2019-12-07 14:04:47,015 INFO L226 Difference]: Without dead ends: 2336 [2019-12-07 14:04:47,016 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 14:04:47,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2019-12-07 14:04:47,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2209. [2019-12-07 14:04:47,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2209 states. [2019-12-07 14:04:47,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 4436 transitions. [2019-12-07 14:04:47,032 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 4436 transitions. Word has length 85 [2019-12-07 14:04:47,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:47,032 INFO L462 AbstractCegarLoop]: Abstraction has 2209 states and 4436 transitions. [2019-12-07 14:04:47,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:04:47,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 4436 transitions. [2019-12-07 14:04:47,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 14:04:47,034 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:47,034 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, 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 14:04:47,034 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:47,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:47,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1178958407, now seen corresponding path program 2 times [2019-12-07 14:04:47,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:47,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250607255] [2019-12-07 14:04:47,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:47,135 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 14:04:47,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250607255] [2019-12-07 14:04:47,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:47,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:04:47,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501462151] [2019-12-07 14:04:47,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:04:47,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:47,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:04:47,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:04:47,136 INFO L87 Difference]: Start difference. First operand 2209 states and 4436 transitions. Second operand 6 states. [2019-12-07 14:04:47,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:47,605 INFO L93 Difference]: Finished difference Result 3286 states and 6536 transitions. [2019-12-07 14:04:47,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:04:47,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-12-07 14:04:47,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:47,607 INFO L225 Difference]: With dead ends: 3286 [2019-12-07 14:04:47,607 INFO L226 Difference]: Without dead ends: 3286 [2019-12-07 14:04:47,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:04:47,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3286 states. [2019-12-07 14:04:47,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3286 to 2934. [2019-12-07 14:04:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2934 states. [2019-12-07 14:04:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 5879 transitions. [2019-12-07 14:04:47,631 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 5879 transitions. Word has length 85 [2019-12-07 14:04:47,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:47,631 INFO L462 AbstractCegarLoop]: Abstraction has 2934 states and 5879 transitions. [2019-12-07 14:04:47,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:04:47,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 5879 transitions. [2019-12-07 14:04:47,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 14:04:47,634 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:47,634 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, 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 14:04:47,634 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:47,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:47,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1989788475, now seen corresponding path program 3 times [2019-12-07 14:04:47,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:47,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455890083] [2019-12-07 14:04:47,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:47,684 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 14:04:47,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455890083] [2019-12-07 14:04:47,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:47,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:04:47,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644489602] [2019-12-07 14:04:47,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:04:47,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:47,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:04:47,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:04:47,686 INFO L87 Difference]: Start difference. First operand 2934 states and 5879 transitions. Second operand 3 states. [2019-12-07 14:04:47,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:47,716 INFO L93 Difference]: Finished difference Result 2933 states and 5877 transitions. [2019-12-07 14:04:47,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:04:47,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-12-07 14:04:47,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:47,718 INFO L225 Difference]: With dead ends: 2933 [2019-12-07 14:04:47,718 INFO L226 Difference]: Without dead ends: 2933 [2019-12-07 14:04:47,718 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 14:04:47,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2019-12-07 14:04:47,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 2801. [2019-12-07 14:04:47,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2801 states. [2019-12-07 14:04:47,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 5633 transitions. [2019-12-07 14:04:47,740 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 5633 transitions. Word has length 85 [2019-12-07 14:04:47,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:47,740 INFO L462 AbstractCegarLoop]: Abstraction has 2801 states and 5633 transitions. [2019-12-07 14:04:47,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:04:47,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 5633 transitions. [2019-12-07 14:04:47,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 14:04:47,743 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:47,743 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, 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 14:04:47,743 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:47,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:47,743 INFO L82 PathProgramCache]: Analyzing trace with hash -2008279433, now seen corresponding path program 1 times [2019-12-07 14:04:47,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:47,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670460771] [2019-12-07 14:04:47,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:47,854 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 14:04:47,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670460771] [2019-12-07 14:04:47,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:47,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 14:04:47,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897216256] [2019-12-07 14:04:47,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 14:04:47,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:47,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 14:04:47,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:04:47,855 INFO L87 Difference]: Start difference. First operand 2801 states and 5633 transitions. Second operand 9 states. [2019-12-07 14:04:48,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:48,479 INFO L93 Difference]: Finished difference Result 9395 states and 18794 transitions. [2019-12-07 14:04:48,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 14:04:48,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-12-07 14:04:48,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:48,484 INFO L225 Difference]: With dead ends: 9395 [2019-12-07 14:04:48,484 INFO L226 Difference]: Without dead ends: 7154 [2019-12-07 14:04:48,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2019-12-07 14:04:48,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7154 states. [2019-12-07 14:04:48,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7154 to 2889. [2019-12-07 14:04:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2889 states. [2019-12-07 14:04:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 5779 transitions. [2019-12-07 14:04:48,523 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 5779 transitions. Word has length 86 [2019-12-07 14:04:48,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:48,523 INFO L462 AbstractCegarLoop]: Abstraction has 2889 states and 5779 transitions. [2019-12-07 14:04:48,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 14:04:48,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 5779 transitions. [2019-12-07 14:04:48,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 14:04:48,526 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:48,526 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, 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 14:04:48,526 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:48,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:48,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1803242103, now seen corresponding path program 2 times [2019-12-07 14:04:48,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:48,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854678909] [2019-12-07 14:04:48,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:48,623 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 14:04:48,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854678909] [2019-12-07 14:04:48,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:48,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 14:04:48,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431100830] [2019-12-07 14:04:48,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 14:04:48,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:48,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 14:04:48,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:04:48,625 INFO L87 Difference]: Start difference. First operand 2889 states and 5779 transitions. Second operand 9 states. [2019-12-07 14:04:49,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:49,209 INFO L93 Difference]: Finished difference Result 7666 states and 15226 transitions. [2019-12-07 14:04:49,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 14:04:49,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-12-07 14:04:49,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:49,217 INFO L225 Difference]: With dead ends: 7666 [2019-12-07 14:04:49,217 INFO L226 Difference]: Without dead ends: 5920 [2019-12-07 14:04:49,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2019-12-07 14:04:49,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5920 states. [2019-12-07 14:04:49,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5920 to 3053. [2019-12-07 14:04:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3053 states. [2019-12-07 14:04:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3053 states to 3053 states and 6088 transitions. [2019-12-07 14:04:49,263 INFO L78 Accepts]: Start accepts. Automaton has 3053 states and 6088 transitions. Word has length 86 [2019-12-07 14:04:49,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:49,263 INFO L462 AbstractCegarLoop]: Abstraction has 3053 states and 6088 transitions. [2019-12-07 14:04:49,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 14:04:49,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3053 states and 6088 transitions. [2019-12-07 14:04:49,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 14:04:49,265 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:49,265 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, 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 14:04:49,265 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:49,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:49,265 INFO L82 PathProgramCache]: Analyzing trace with hash 2047945591, now seen corresponding path program 3 times [2019-12-07 14:04:49,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:49,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705693521] [2019-12-07 14:04:49,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:49,349 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 14:04:49,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705693521] [2019-12-07 14:04:49,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:49,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:04:49,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293284925] [2019-12-07 14:04:49,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:04:49,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:49,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:04:49,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:04:49,350 INFO L87 Difference]: Start difference. First operand 3053 states and 6088 transitions. Second operand 5 states. [2019-12-07 14:04:49,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:49,412 INFO L93 Difference]: Finished difference Result 5000 states and 9998 transitions. [2019-12-07 14:04:49,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:04:49,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-12-07 14:04:49,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:49,413 INFO L225 Difference]: With dead ends: 5000 [2019-12-07 14:04:49,414 INFO L226 Difference]: Without dead ends: 2024 [2019-12-07 14:04:49,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:04:49,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2019-12-07 14:04:49,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 1904. [2019-12-07 14:04:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2019-12-07 14:04:49,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 3824 transitions. [2019-12-07 14:04:49,429 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 3824 transitions. Word has length 86 [2019-12-07 14:04:49,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:49,429 INFO L462 AbstractCegarLoop]: Abstraction has 1904 states and 3824 transitions. [2019-12-07 14:04:49,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:04:49,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 3824 transitions. [2019-12-07 14:04:49,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 14:04:49,430 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:49,430 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, 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 14:04:49,430 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:49,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:49,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1235241571, now seen corresponding path program 4 times [2019-12-07 14:04:49,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:49,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786291505] [2019-12-07 14:04:49,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:49,514 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 14:04:49,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786291505] [2019-12-07 14:04:49,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:49,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:04:49,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615838451] [2019-12-07 14:04:49,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:04:49,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:49,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:04:49,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:04:49,515 INFO L87 Difference]: Start difference. First operand 1904 states and 3824 transitions. Second operand 6 states. [2019-12-07 14:04:49,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:49,652 INFO L93 Difference]: Finished difference Result 2879 states and 5812 transitions. [2019-12-07 14:04:49,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:04:49,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-12-07 14:04:49,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:49,654 INFO L225 Difference]: With dead ends: 2879 [2019-12-07 14:04:49,654 INFO L226 Difference]: Without dead ends: 2879 [2019-12-07 14:04:49,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:04:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2019-12-07 14:04:49,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2536. [2019-12-07 14:04:49,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2536 states. [2019-12-07 14:04:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 5158 transitions. [2019-12-07 14:04:49,674 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 5158 transitions. Word has length 86 [2019-12-07 14:04:49,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:49,674 INFO L462 AbstractCegarLoop]: Abstraction has 2536 states and 5158 transitions. [2019-12-07 14:04:49,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:04:49,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 5158 transitions. [2019-12-07 14:04:49,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 14:04:49,675 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:49,676 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, 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 14:04:49,676 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:49,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:49,676 INFO L82 PathProgramCache]: Analyzing trace with hash -768002551, now seen corresponding path program 1 times [2019-12-07 14:04:49,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:49,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699426810] [2019-12-07 14:04:49,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:49,960 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 14:04:49,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699426810] [2019-12-07 14:04:49,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:49,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 14:04:49,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667519514] [2019-12-07 14:04:49,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 14:04:49,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:49,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 14:04:49,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-12-07 14:04:49,962 INFO L87 Difference]: Start difference. First operand 2536 states and 5158 transitions. Second operand 18 states. [2019-12-07 14:04:50,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:50,908 INFO L93 Difference]: Finished difference Result 5653 states and 11446 transitions. [2019-12-07 14:04:50,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 14:04:50,908 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2019-12-07 14:04:50,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:50,911 INFO L225 Difference]: With dead ends: 5653 [2019-12-07 14:04:50,911 INFO L226 Difference]: Without dead ends: 5612 [2019-12-07 14:04:50,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=322, Invalid=1400, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 14:04:50,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5612 states. [2019-12-07 14:04:50,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5612 to 4196. [2019-12-07 14:04:50,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4196 states. [2019-12-07 14:04:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4196 states to 4196 states and 8580 transitions. [2019-12-07 14:04:50,950 INFO L78 Accepts]: Start accepts. Automaton has 4196 states and 8580 transitions. Word has length 87 [2019-12-07 14:04:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:50,950 INFO L462 AbstractCegarLoop]: Abstraction has 4196 states and 8580 transitions. [2019-12-07 14:04:50,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 14:04:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 4196 states and 8580 transitions. [2019-12-07 14:04:50,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 14:04:50,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:50,953 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, 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 14:04:50,953 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:50,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:50,953 INFO L82 PathProgramCache]: Analyzing trace with hash 927908343, now seen corresponding path program 2 times [2019-12-07 14:04:50,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:50,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790451417] [2019-12-07 14:04:50,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:04:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:04:51,085 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 14:04:51,086 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:04:51,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1301] [1301] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1585~0.base_22|) 0) (= v_~y$r_buff0_thd0~0_332 0) (= 0 v_~x~0_194) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff1~0_277 0) (= v_~__unbuffered_p1_EBX~0_58 0) (= v_~y$flush_delayed~0_268 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1585~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1585~0.base_22|) |v_ULTIMATE.start_main_~#t1585~0.offset_16| 0)) |v_#memory_int_17|) (= v_~main$tmp_guard0~0_27 0) (= v_~y$r_buff0_thd1~0_239 0) (= 0 v_~weak$$choice0~0_149) (= |v_ULTIMATE.start_main_~#t1585~0.offset_16| 0) (= v_~y$w_buff1_used~0_756 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_88) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~y$r_buff1_thd2~0_570) (= v_~y$r_buff1_thd0~0_410 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t1585~0.base_22| 1)) (= 0 v_~y$r_buff0_thd2~0_605) (= 0 v_~__unbuffered_cnt~0_64) (= v_~weak$$choice2~0_244 0) (= 0 v_~y$w_buff0~0_330) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1585~0.base_22| 4)) (= 0 |v_#NULL.base_7|) (= v_~y~0_435 0) (= v_~main$tmp_guard1~0_84 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1585~0.base_22|) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff1_thd1~0_207 0) (= v_~y$w_buff0_used~0_1139 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_180|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_36|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_70|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_164|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_20|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_30|, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ULTIMATE.start_main_~#t1586~0.base=|v_ULTIMATE.start_main_~#t1586~0.base_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_88, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_63|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_239, ~y$flush_delayed~0=v_~y$flush_delayed~0_268, #length=|v_#length_17|, ULTIMATE.start_main_~#t1585~0.offset=|v_ULTIMATE.start_main_~#t1585~0.offset_16|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_15|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_80|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_68|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_74|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_34|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_393|, ~weak$$choice0~0=v_~weak$$choice0~0_149, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_227|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_83|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_605, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_410, ~x~0=v_~x~0_194, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1139, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ULTIMATE.start_main_~#t1585~0.base=|v_ULTIMATE.start_main_~#t1585~0.base_22|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_26|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_61|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_44|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_30|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_48|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_207, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_24|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_151|, ULTIMATE.start_main_~#t1586~0.offset=|v_ULTIMATE.start_main_~#t1586~0.offset_15|, ~y$w_buff0~0=v_~y$w_buff0~0_330, ~y~0=v_~y~0_435, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_58, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_164|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_8|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_96|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_63|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_25|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_570, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_240|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_141|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_332, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_17|, ~weak$$choice2~0=v_~weak$$choice2~0_244, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_756} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ULTIMATE.start_main_~#t1586~0.base, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1585~0.offset, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1585~0.base, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ULTIMATE.start_main_~#t1586~0.offset, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:04:51,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] L813-1-->L815: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1586~0.base_10| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1586~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1586~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1586~0.offset_9| 0) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1586~0.base_10|) 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1586~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1586~0.base_10|) |v_ULTIMATE.start_main_~#t1586~0.offset_9| 1)) |v_#memory_int_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1586~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1586~0.base=|v_ULTIMATE.start_main_~#t1586~0.base_10|, ULTIMATE.start_main_~#t1586~0.offset=|v_ULTIMATE.start_main_~#t1586~0.offset_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1586~0.base, ULTIMATE.start_main_~#t1586~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 14:04:51,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1182] [1182] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_6|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_6|) (= v_~y$w_buff0_used~0_345 v_~y$w_buff1_used~0_208) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0_used~0_344 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= v_~y$w_buff0~0_64 v_~y$w_buff1~0_60) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_344 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_208 256))))) 1 0)) (= 2 v_~y$w_buff0~0_63)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff0~0=v_~y$w_buff0~0_64, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_344, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_63, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_208} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:04:51,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In225701009 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite31_Out225701009| ~y~0_In225701009)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite31_Out225701009| ~y$mem_tmp~0_In225701009)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In225701009, ~y$flush_delayed~0=~y$flush_delayed~0_In225701009, ~y~0=~y~0_In225701009} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In225701009, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out225701009|, ~y$flush_delayed~0=~y$flush_delayed~0_In225701009, ~y~0=~y~0_In225701009} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 14:04:51,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In199055359 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite54_Out199055359| ~y~0_In199055359) .cse0) (and (= ~y$mem_tmp~0_In199055359 |P1Thread1of1ForFork1_#t~ite54_Out199055359|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In199055359, ~y$flush_delayed~0=~y$flush_delayed~0_In199055359, ~y~0=~y~0_In199055359} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In199055359, ~y$flush_delayed~0=~y$flush_delayed~0_In199055359, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out199055359|, ~y~0=~y~0_In199055359} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 14:04:51,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In102037472 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In102037472 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In102037472 |P0Thread1of1ForFork0_#t~ite5_Out102037472|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out102037472|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In102037472, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In102037472} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out102037472|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In102037472, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In102037472} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 14:04:51,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1220] [1220] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In1736443732 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1736443732 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In1736443732 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1736443732 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1736443732| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1736443732 |P0Thread1of1ForFork0_#t~ite6_Out1736443732|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1736443732, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1736443732, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1736443732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1736443732} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1736443732|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1736443732, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1736443732, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1736443732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1736443732} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 14:04:51,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1209] [1209] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In115393599 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In115393599 256))) (.cse2 (= ~y$r_buff0_thd1~0_Out115393599 ~y$r_buff0_thd1~0_In115393599))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out115393599 0) (not .cse1)) (and .cse2 .cse0) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In115393599, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In115393599} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In115393599, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out115393599|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out115393599} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:04:51,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-691814571 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-691814571 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-691814571 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-691814571 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-691814571| ~y$r_buff1_thd1~0_In-691814571)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out-691814571| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-691814571, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-691814571, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-691814571, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-691814571} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-691814571, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-691814571, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-691814571|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-691814571, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-691814571} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 14:04:51,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~y$r_buff1_thd1~0_56 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 14:04:51,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1217] [1217] L790-2-->L790-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite56_Out-1215909847| |P1Thread1of1ForFork1_#t~ite55_Out-1215909847|)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1215909847 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1215909847 256)))) (or (and .cse0 (= ~y$w_buff1~0_In-1215909847 |P1Thread1of1ForFork1_#t~ite55_Out-1215909847|) (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork1_#t~ite55_Out-1215909847| ~y~0_In-1215909847)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1215909847, ~y$w_buff1~0=~y$w_buff1~0_In-1215909847, ~y~0=~y~0_In-1215909847, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1215909847} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1215909847, ~y$w_buff1~0=~y$w_buff1~0_In-1215909847, P1Thread1of1ForFork1_#t~ite56=|P1Thread1of1ForFork1_#t~ite56_Out-1215909847|, P1Thread1of1ForFork1_#t~ite55=|P1Thread1of1ForFork1_#t~ite55_Out-1215909847|, ~y~0=~y~0_In-1215909847, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1215909847} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55] because there is no mapped edge [2019-12-07 14:04:51,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1070227847 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1070227847 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite57_Out1070227847| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite57_Out1070227847| ~y$w_buff0_used~0_In1070227847) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1070227847, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1070227847} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1070227847, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1070227847, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out1070227847|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-07 14:04:51,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1210] [1210] L792-->L792-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In796747869 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In796747869 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In796747869 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In796747869 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite58_Out796747869| 0)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In796747869 |P1Thread1of1ForFork1_#t~ite58_Out796747869|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In796747869, ~y$w_buff0_used~0=~y$w_buff0_used~0_In796747869, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In796747869, ~y$w_buff1_used~0=~y$w_buff1_used~0_In796747869} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In796747869, ~y$w_buff0_used~0=~y$w_buff0_used~0_In796747869, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In796747869, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out796747869|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In796747869} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-07 14:04:51,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L793-->L793-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-426839053 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-426839053 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-426839053 |P1Thread1of1ForFork1_#t~ite59_Out-426839053|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite59_Out-426839053|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-426839053, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-426839053} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-426839053, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-426839053, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out-426839053|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-07 14:04:51,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1237] [1237] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In2144930621 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2144930621 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In2144930621 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In2144930621 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite60_Out2144930621| ~y$r_buff1_thd2~0_In2144930621) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite60_Out2144930621|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2144930621, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2144930621, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2144930621, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2144930621} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2144930621, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2144930621, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out2144930621|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2144930621, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2144930621} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-07 14:04:51,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1271] [1271] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_267 |v_P1Thread1of1ForFork1_#t~ite60_38|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_267, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 14:04:51,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_104 256)) (= 0 (mod v_~y$w_buff0_used~0_277 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:04:51,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1233] [1233] L821-2-->L821-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1314748449 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1314748449 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-1314748449| ~y$w_buff1~0_In-1314748449) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite63_Out-1314748449| ~y~0_In-1314748449) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1314748449, ~y~0=~y~0_In-1314748449, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1314748449, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1314748449} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1314748449|, ~y$w_buff1~0=~y$w_buff1~0_In-1314748449, ~y~0=~y~0_In-1314748449, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1314748449, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1314748449} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 14:04:51,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L821-4-->L822: Formula: (= v_~y~0_95 |v_ULTIMATE.start_main_#t~ite63_11|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~y~0=v_~y~0_95, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 14:04:51,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1236] [1236] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1628339568 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1628339568 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite65_Out-1628339568| ~y$w_buff0_used~0_In-1628339568)) (and (= |ULTIMATE.start_main_#t~ite65_Out-1628339568| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1628339568, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1628339568} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1628339568, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1628339568, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-1628339568|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 14:04:51,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L823-->L823-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-746597096 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-746597096 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-746597096 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-746597096 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite66_Out-746597096| ~y$w_buff1_used~0_In-746597096) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite66_Out-746597096| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-746597096, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-746597096, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-746597096, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-746597096} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-746597096, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-746597096, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-746597096|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-746597096, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-746597096} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 14:04:51,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1226] [1226] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1012329657 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1012329657 256)))) (or (and (= |ULTIMATE.start_main_#t~ite67_Out1012329657| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite67_Out1012329657| ~y$r_buff0_thd0~0_In1012329657)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1012329657, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1012329657} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1012329657, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1012329657, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out1012329657|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 14:04:51,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In937966448 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In937966448 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In937966448 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In937966448 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite68_Out937966448| 0)) (and (= |ULTIMATE.start_main_#t~ite68_Out937966448| ~y$r_buff1_thd0~0_In937966448) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In937966448, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In937966448, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In937966448, ~y$w_buff1_used~0=~y$w_buff1_used~0_In937966448} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In937966448, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In937966448, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out937966448|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In937966448, ~y$w_buff1_used~0=~y$w_buff1_used~0_In937966448} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 14:04:51,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1216] [1216] L840-->L840-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1127634168 256) 0))) (or (and .cse0 (= ~y~0_In1127634168 |ULTIMATE.start_main_#t~ite91_Out1127634168|)) (and (= |ULTIMATE.start_main_#t~ite91_Out1127634168| ~y$mem_tmp~0_In1127634168) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1127634168, ~y$flush_delayed~0=~y$flush_delayed~0_In1127634168, ~y~0=~y~0_In1127634168} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1127634168, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out1127634168|, ~y$flush_delayed~0=~y$flush_delayed~0_In1127634168, ~y~0=~y~0_In1127634168} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-07 14:04:51,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1284] [1284] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_37 256)) (= v_~y~0_283 |v_ULTIMATE.start_main_#t~ite91_30|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y$flush_delayed~0_174 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_29|, ~y$flush_delayed~0=v_~y$flush_delayed~0_174, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~y~0=v_~y~0_283, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:04:51,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:04:51 BasicIcfg [2019-12-07 14:04:51,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:04:51,169 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:04:51,169 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:04:51,169 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:04:51,169 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:04:29" (3/4) ... [2019-12-07 14:04:51,171 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:04:51,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1301] [1301] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1585~0.base_22|) 0) (= v_~y$r_buff0_thd0~0_332 0) (= 0 v_~x~0_194) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff1~0_277 0) (= v_~__unbuffered_p1_EBX~0_58 0) (= v_~y$flush_delayed~0_268 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1585~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1585~0.base_22|) |v_ULTIMATE.start_main_~#t1585~0.offset_16| 0)) |v_#memory_int_17|) (= v_~main$tmp_guard0~0_27 0) (= v_~y$r_buff0_thd1~0_239 0) (= 0 v_~weak$$choice0~0_149) (= |v_ULTIMATE.start_main_~#t1585~0.offset_16| 0) (= v_~y$w_buff1_used~0_756 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_88) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~y$r_buff1_thd2~0_570) (= v_~y$r_buff1_thd0~0_410 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t1585~0.base_22| 1)) (= 0 v_~y$r_buff0_thd2~0_605) (= 0 v_~__unbuffered_cnt~0_64) (= v_~weak$$choice2~0_244 0) (= 0 v_~y$w_buff0~0_330) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1585~0.base_22| 4)) (= 0 |v_#NULL.base_7|) (= v_~y~0_435 0) (= v_~main$tmp_guard1~0_84 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1585~0.base_22|) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff1_thd1~0_207 0) (= v_~y$w_buff0_used~0_1139 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_180|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_36|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_70|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_164|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_20|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_30|, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ULTIMATE.start_main_~#t1586~0.base=|v_ULTIMATE.start_main_~#t1586~0.base_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_88, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_63|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_239, ~y$flush_delayed~0=v_~y$flush_delayed~0_268, #length=|v_#length_17|, ULTIMATE.start_main_~#t1585~0.offset=|v_ULTIMATE.start_main_~#t1585~0.offset_16|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_15|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_80|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_68|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_74|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_34|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_393|, ~weak$$choice0~0=v_~weak$$choice0~0_149, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_227|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_83|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_605, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_410, ~x~0=v_~x~0_194, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1139, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ULTIMATE.start_main_~#t1585~0.base=|v_ULTIMATE.start_main_~#t1585~0.base_22|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_26|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_61|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_44|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_30|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_48|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_207, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_24|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_151|, ULTIMATE.start_main_~#t1586~0.offset=|v_ULTIMATE.start_main_~#t1586~0.offset_15|, ~y$w_buff0~0=v_~y$w_buff0~0_330, ~y~0=v_~y~0_435, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_58, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_164|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_8|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_96|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_63|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_25|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_570, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_240|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_141|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_332, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_17|, ~weak$$choice2~0=v_~weak$$choice2~0_244, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_756} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ULTIMATE.start_main_~#t1586~0.base, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1585~0.offset, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1585~0.base, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ULTIMATE.start_main_~#t1586~0.offset, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:04:51,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] L813-1-->L815: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1586~0.base_10| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1586~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1586~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1586~0.offset_9| 0) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1586~0.base_10|) 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1586~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1586~0.base_10|) |v_ULTIMATE.start_main_~#t1586~0.offset_9| 1)) |v_#memory_int_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1586~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1586~0.base=|v_ULTIMATE.start_main_~#t1586~0.base_10|, ULTIMATE.start_main_~#t1586~0.offset=|v_ULTIMATE.start_main_~#t1586~0.offset_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1586~0.base, ULTIMATE.start_main_~#t1586~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 14:04:51,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1182] [1182] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_6|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_6|) (= v_~y$w_buff0_used~0_345 v_~y$w_buff1_used~0_208) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0_used~0_344 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= v_~y$w_buff0~0_64 v_~y$w_buff1~0_60) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_344 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_208 256))))) 1 0)) (= 2 v_~y$w_buff0~0_63)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff0~0=v_~y$w_buff0~0_64, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_344, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_63, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_208} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:04:51,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In225701009 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite31_Out225701009| ~y~0_In225701009)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite31_Out225701009| ~y$mem_tmp~0_In225701009)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In225701009, ~y$flush_delayed~0=~y$flush_delayed~0_In225701009, ~y~0=~y~0_In225701009} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In225701009, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out225701009|, ~y$flush_delayed~0=~y$flush_delayed~0_In225701009, ~y~0=~y~0_In225701009} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 14:04:51,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In199055359 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite54_Out199055359| ~y~0_In199055359) .cse0) (and (= ~y$mem_tmp~0_In199055359 |P1Thread1of1ForFork1_#t~ite54_Out199055359|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In199055359, ~y$flush_delayed~0=~y$flush_delayed~0_In199055359, ~y~0=~y~0_In199055359} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In199055359, ~y$flush_delayed~0=~y$flush_delayed~0_In199055359, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out199055359|, ~y~0=~y~0_In199055359} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 14:04:51,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In102037472 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In102037472 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In102037472 |P0Thread1of1ForFork0_#t~ite5_Out102037472|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out102037472|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In102037472, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In102037472} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out102037472|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In102037472, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In102037472} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 14:04:51,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1220] [1220] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In1736443732 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1736443732 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In1736443732 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1736443732 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1736443732| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1736443732 |P0Thread1of1ForFork0_#t~ite6_Out1736443732|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1736443732, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1736443732, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1736443732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1736443732} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1736443732|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1736443732, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1736443732, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1736443732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1736443732} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 14:04:51,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1209] [1209] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In115393599 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In115393599 256))) (.cse2 (= ~y$r_buff0_thd1~0_Out115393599 ~y$r_buff0_thd1~0_In115393599))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out115393599 0) (not .cse1)) (and .cse2 .cse0) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In115393599, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In115393599} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In115393599, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out115393599|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out115393599} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:04:51,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-691814571 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-691814571 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-691814571 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-691814571 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-691814571| ~y$r_buff1_thd1~0_In-691814571)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out-691814571| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-691814571, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-691814571, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-691814571, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-691814571} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-691814571, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-691814571, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-691814571|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-691814571, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-691814571} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 14:04:51,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~y$r_buff1_thd1~0_56 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 14:04:51,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1217] [1217] L790-2-->L790-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite56_Out-1215909847| |P1Thread1of1ForFork1_#t~ite55_Out-1215909847|)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1215909847 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1215909847 256)))) (or (and .cse0 (= ~y$w_buff1~0_In-1215909847 |P1Thread1of1ForFork1_#t~ite55_Out-1215909847|) (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork1_#t~ite55_Out-1215909847| ~y~0_In-1215909847)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1215909847, ~y$w_buff1~0=~y$w_buff1~0_In-1215909847, ~y~0=~y~0_In-1215909847, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1215909847} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1215909847, ~y$w_buff1~0=~y$w_buff1~0_In-1215909847, P1Thread1of1ForFork1_#t~ite56=|P1Thread1of1ForFork1_#t~ite56_Out-1215909847|, P1Thread1of1ForFork1_#t~ite55=|P1Thread1of1ForFork1_#t~ite55_Out-1215909847|, ~y~0=~y~0_In-1215909847, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1215909847} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55] because there is no mapped edge [2019-12-07 14:04:51,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1070227847 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1070227847 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite57_Out1070227847| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite57_Out1070227847| ~y$w_buff0_used~0_In1070227847) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1070227847, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1070227847} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1070227847, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1070227847, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out1070227847|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-07 14:04:51,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1210] [1210] L792-->L792-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In796747869 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In796747869 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In796747869 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In796747869 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite58_Out796747869| 0)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In796747869 |P1Thread1of1ForFork1_#t~ite58_Out796747869|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In796747869, ~y$w_buff0_used~0=~y$w_buff0_used~0_In796747869, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In796747869, ~y$w_buff1_used~0=~y$w_buff1_used~0_In796747869} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In796747869, ~y$w_buff0_used~0=~y$w_buff0_used~0_In796747869, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In796747869, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out796747869|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In796747869} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-07 14:04:51,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L793-->L793-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-426839053 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-426839053 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-426839053 |P1Thread1of1ForFork1_#t~ite59_Out-426839053|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite59_Out-426839053|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-426839053, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-426839053} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-426839053, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-426839053, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out-426839053|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-07 14:04:51,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1237] [1237] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In2144930621 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2144930621 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In2144930621 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In2144930621 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite60_Out2144930621| ~y$r_buff1_thd2~0_In2144930621) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite60_Out2144930621|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2144930621, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2144930621, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2144930621, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2144930621} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2144930621, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2144930621, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out2144930621|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2144930621, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2144930621} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-07 14:04:51,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1271] [1271] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_267 |v_P1Thread1of1ForFork1_#t~ite60_38|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_267, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 14:04:51,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_104 256)) (= 0 (mod v_~y$w_buff0_used~0_277 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:04:51,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1233] [1233] L821-2-->L821-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1314748449 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1314748449 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-1314748449| ~y$w_buff1~0_In-1314748449) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite63_Out-1314748449| ~y~0_In-1314748449) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1314748449, ~y~0=~y~0_In-1314748449, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1314748449, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1314748449} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1314748449|, ~y$w_buff1~0=~y$w_buff1~0_In-1314748449, ~y~0=~y~0_In-1314748449, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1314748449, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1314748449} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 14:04:51,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L821-4-->L822: Formula: (= v_~y~0_95 |v_ULTIMATE.start_main_#t~ite63_11|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~y~0=v_~y~0_95, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 14:04:51,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1236] [1236] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1628339568 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1628339568 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite65_Out-1628339568| ~y$w_buff0_used~0_In-1628339568)) (and (= |ULTIMATE.start_main_#t~ite65_Out-1628339568| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1628339568, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1628339568} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1628339568, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1628339568, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-1628339568|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 14:04:51,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L823-->L823-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-746597096 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-746597096 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-746597096 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-746597096 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite66_Out-746597096| ~y$w_buff1_used~0_In-746597096) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite66_Out-746597096| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-746597096, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-746597096, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-746597096, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-746597096} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-746597096, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-746597096, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-746597096|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-746597096, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-746597096} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 14:04:51,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1226] [1226] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1012329657 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1012329657 256)))) (or (and (= |ULTIMATE.start_main_#t~ite67_Out1012329657| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite67_Out1012329657| ~y$r_buff0_thd0~0_In1012329657)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1012329657, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1012329657} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1012329657, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1012329657, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out1012329657|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 14:04:51,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In937966448 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In937966448 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In937966448 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In937966448 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite68_Out937966448| 0)) (and (= |ULTIMATE.start_main_#t~ite68_Out937966448| ~y$r_buff1_thd0~0_In937966448) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In937966448, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In937966448, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In937966448, ~y$w_buff1_used~0=~y$w_buff1_used~0_In937966448} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In937966448, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In937966448, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out937966448|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In937966448, ~y$w_buff1_used~0=~y$w_buff1_used~0_In937966448} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 14:04:51,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1216] [1216] L840-->L840-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1127634168 256) 0))) (or (and .cse0 (= ~y~0_In1127634168 |ULTIMATE.start_main_#t~ite91_Out1127634168|)) (and (= |ULTIMATE.start_main_#t~ite91_Out1127634168| ~y$mem_tmp~0_In1127634168) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1127634168, ~y$flush_delayed~0=~y$flush_delayed~0_In1127634168, ~y~0=~y~0_In1127634168} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1127634168, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out1127634168|, ~y$flush_delayed~0=~y$flush_delayed~0_In1127634168, ~y~0=~y~0_In1127634168} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-07 14:04:51,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1284] [1284] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_37 256)) (= v_~y~0_283 |v_ULTIMATE.start_main_#t~ite91_30|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y$flush_delayed~0_174 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_29|, ~y$flush_delayed~0=v_~y$flush_delayed~0_174, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~y~0=v_~y~0_283, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:04:51,253 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a327e8b7-5cf9-4f1a-8f44-80ded124125c/bin/utaipan/witness.graphml [2019-12-07 14:04:51,253 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:04:51,254 INFO L168 Benchmark]: Toolchain (without parser) took 22540.96 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 940.8 MB in the beginning and 1.6 GB in the end (delta: -630.9 MB). Peak memory consumption was 502.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:04:51,255 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:04:51,255 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:04:51,255 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:04:51,255 INFO L168 Benchmark]: Boogie Preprocessor took 31.46 ms. Allocated memory is still 1.2 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 14:04:51,256 INFO L168 Benchmark]: RCFGBuilder took 526.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.8 MB). Peak memory consumption was 71.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:04:51,256 INFO L168 Benchmark]: TraceAbstraction took 21450.99 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -616.8 MB). Peak memory consumption was 392.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:04:51,256 INFO L168 Benchmark]: Witness Printer took 84.31 ms. Allocated memory is still 2.2 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:04:51,257 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 401.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.46 ms. Allocated memory is still 1.2 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. * RCFGBuilder took 526.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.8 MB). Peak memory consumption was 71.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21450.99 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -616.8 MB). Peak memory consumption was 392.5 MB. Max. memory is 11.5 GB. * Witness Printer took 84.31 ms. Allocated memory is still 2.2 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 231 ProgramPointsBefore, 150 ProgramPointsAfterwards, 307 TransitionsBefore, 186 TransitionsAfterwards, 41414 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 69 ConcurrentYvCompositions, 43 ChoiceCompositions, 14826 VarBasedMoverChecksPositive, 421 VarBasedMoverChecksNegative, 121 SemBasedMoverChecksPositive, 422 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 238871 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t1586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 y = 1 [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L768] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y = y$flush_delayed ? y$mem_tmp : y [L771] 2 y$flush_delayed = (_Bool)0 [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L790] 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 [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 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) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 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 [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 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 [L828] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 0 y$flush_delayed = weak$$choice2 [L831] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] 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) [L833] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] 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)) [L834] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L834] 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)) [L835] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 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)) [L836] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 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)) [L837] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] 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)) [L839] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 21.2s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8411 SDtfs, 7461 SDslu, 27932 SDs, 0 SdLazy, 7859 SolverSat, 346 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 49 SyntacticMatches, 12 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55330occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 28940 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1244 NumberOfCodeBlocks, 1244 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1136 ConstructedInterpolants, 0 QuantifiedInterpolants, 383898 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...