./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix020_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_461cccf8-347c-4611-94df-f8e4db199921/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_461cccf8-347c-4611-94df-f8e4db199921/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_461cccf8-347c-4611-94df-f8e4db199921/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_461cccf8-347c-4611-94df-f8e4db199921/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix020_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_461cccf8-347c-4611-94df-f8e4db199921/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_461cccf8-347c-4611-94df-f8e4db199921/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 78532c974a7a5f758fd4600acac66d58b0c04b4c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:25:10,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:25:10,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:25:10,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:25:10,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:25:10,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:25:10,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:25:10,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:25:10,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:25:10,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:25:10,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:25:10,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:25:10,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:25:10,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:25:10,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:25:10,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:25:10,211 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:25:10,212 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:25:10,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:25:10,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:25:10,215 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:25:10,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:25:10,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:25:10,217 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:25:10,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:25:10,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:25:10,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:25:10,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:25:10,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:25:10,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:25:10,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:25:10,222 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:25:10,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:25:10,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:25:10,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:25:10,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:25:10,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:25:10,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:25:10,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:25:10,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:25:10,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:25:10,226 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_461cccf8-347c-4611-94df-f8e4db199921/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 14:25:10,239 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:25:10,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:25:10,240 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:25:10,240 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:25:10,240 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:25:10,240 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:25:10,240 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:25:10,240 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:25:10,241 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:25:10,241 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:25:10,241 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:25:10,241 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:25:10,241 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:25:10,241 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:25:10,242 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:25:10,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:25:10,242 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:25:10,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:25:10,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:25:10,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:25:10,243 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:25:10,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:25:10,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:25:10,243 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:25:10,244 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:25:10,244 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:25:10,244 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:25:10,244 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:25:10,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:25:10,245 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:25:10,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:25:10,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:25:10,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:25:10,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:25:10,246 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:25:10,246 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:25:10,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:25:10,246 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:25:10,246 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:25:10,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:25:10,247 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_461cccf8-347c-4611-94df-f8e4db199921/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 -> 78532c974a7a5f758fd4600acac66d58b0c04b4c [2019-12-07 14:25:10,351 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:25:10,361 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:25:10,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:25:10,365 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:25:10,366 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:25:10,366 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_461cccf8-347c-4611-94df-f8e4db199921/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix020_pso.opt.i [2019-12-07 14:25:10,413 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_461cccf8-347c-4611-94df-f8e4db199921/bin/utaipan/data/2f282d6c6/6507e6453fbb49bebf1982c82d450c01/FLAG9879c7239 [2019-12-07 14:25:10,791 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:25:10,792 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_461cccf8-347c-4611-94df-f8e4db199921/sv-benchmarks/c/pthread-wmm/mix020_pso.opt.i [2019-12-07 14:25:10,802 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_461cccf8-347c-4611-94df-f8e4db199921/bin/utaipan/data/2f282d6c6/6507e6453fbb49bebf1982c82d450c01/FLAG9879c7239 [2019-12-07 14:25:10,811 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_461cccf8-347c-4611-94df-f8e4db199921/bin/utaipan/data/2f282d6c6/6507e6453fbb49bebf1982c82d450c01 [2019-12-07 14:25:10,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:25:10,814 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:25:10,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:25:10,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:25:10,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:25:10,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:25:10" (1/1) ... [2019-12-07 14:25:10,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:10, skipping insertion in model container [2019-12-07 14:25:10,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:25:10" (1/1) ... [2019-12-07 14:25:10,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:25:10,851 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:25:11,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:25:11,155 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:25:11,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:25:11,269 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:25:11,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:11 WrapperNode [2019-12-07 14:25:11,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:25:11,270 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:25:11,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:25:11,270 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:25:11,276 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:25:11" (1/1) ... [2019-12-07 14:25:11,291 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:25:11" (1/1) ... [2019-12-07 14:25:11,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:25:11,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:25:11,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:25:11,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:25:11,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:11" (1/1) ... [2019-12-07 14:25:11,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:11" (1/1) ... [2019-12-07 14:25:11,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:11" (1/1) ... [2019-12-07 14:25:11,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:11" (1/1) ... [2019-12-07 14:25:11,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:11" (1/1) ... [2019-12-07 14:25:11,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:11" (1/1) ... [2019-12-07 14:25:11,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:11" (1/1) ... [2019-12-07 14:25:11,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:25:11,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:25:11,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:25:11,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:25:11,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_461cccf8-347c-4611-94df-f8e4db199921/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:25:11,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:25:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:25:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:25:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:25:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:25:11,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:25:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:25:11,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:25:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 14:25:11,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 14:25:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 14:25:11,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 14:25:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:25:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:25:11,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:25:11,384 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:25:11,791 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:25:11,791 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:25:11,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:25:11 BoogieIcfgContainer [2019-12-07 14:25:11,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:25:11,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:25:11,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:25:11,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:25:11,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:25:10" (1/3) ... [2019-12-07 14:25:11,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a93fac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:25:11, skipping insertion in model container [2019-12-07 14:25:11,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:11" (2/3) ... [2019-12-07 14:25:11,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a93fac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:25:11, skipping insertion in model container [2019-12-07 14:25:11,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:25:11" (3/3) ... [2019-12-07 14:25:11,796 INFO L109 eAbstractionObserver]: Analyzing ICFG mix020_pso.opt.i [2019-12-07 14:25:11,803 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:25:11,803 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:25:11,807 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:25:11,808 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:25:11,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,836 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,836 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,837 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,837 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,838 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,838 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,849 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,849 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,849 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,849 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,849 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:11,873 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 14:25:11,887 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:25:11,887 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:25:11,887 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:25:11,887 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:25:11,887 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:25:11,887 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:25:11,887 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:25:11,887 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:25:11,898 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 254 transitions [2019-12-07 14:25:11,899 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 14:25:11,970 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 14:25:11,970 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:25:11,981 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 928 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 14:25:12,003 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 14:25:12,046 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 14:25:12,046 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:25:12,054 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 928 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 14:25:12,079 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 14:25:12,080 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:25:15,755 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 14:25:16,079 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 14:25:16,190 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-07 14:25:16,235 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142340 [2019-12-07 14:25:16,235 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-07 14:25:16,237 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 131 transitions [2019-12-07 14:25:24,393 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 90046 states. [2019-12-07 14:25:24,394 INFO L276 IsEmpty]: Start isEmpty. Operand 90046 states. [2019-12-07 14:25:24,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 14:25:24,399 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:24,399 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:24,400 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:24,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:24,404 INFO L82 PathProgramCache]: Analyzing trace with hash 259811849, now seen corresponding path program 1 times [2019-12-07 14:25:24,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:24,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407358391] [2019-12-07 14:25:24,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:24,566 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:25:24,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407358391] [2019-12-07 14:25:24,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:24,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:25:24,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773516515] [2019-12-07 14:25:24,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:25:24,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:24,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:25:24,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:25:24,581 INFO L87 Difference]: Start difference. First operand 90046 states. Second operand 3 states. [2019-12-07 14:25:25,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:25,325 INFO L93 Difference]: Finished difference Result 89182 states and 411616 transitions. [2019-12-07 14:25:25,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:25:25,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 14:25:25,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:25,814 INFO L225 Difference]: With dead ends: 89182 [2019-12-07 14:25:25,814 INFO L226 Difference]: Without dead ends: 83470 [2019-12-07 14:25:25,815 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:25:27,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83470 states. [2019-12-07 14:25:28,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83470 to 83470. [2019-12-07 14:25:28,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83470 states. [2019-12-07 14:25:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83470 states to 83470 states and 385016 transitions. [2019-12-07 14:25:28,877 INFO L78 Accepts]: Start accepts. Automaton has 83470 states and 385016 transitions. Word has length 9 [2019-12-07 14:25:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:28,878 INFO L462 AbstractCegarLoop]: Abstraction has 83470 states and 385016 transitions. [2019-12-07 14:25:28,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:25:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 83470 states and 385016 transitions. [2019-12-07 14:25:28,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 14:25:28,884 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:28,884 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:28,884 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:28,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:28,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1558204525, now seen corresponding path program 1 times [2019-12-07 14:25:28,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:28,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763589840] [2019-12-07 14:25:28,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,953 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:25:28,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763589840] [2019-12-07 14:25:28,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:28,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:25:28,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143571763] [2019-12-07 14:25:28,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:25:28,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:28,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:25:28,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:25:28,956 INFO L87 Difference]: Start difference. First operand 83470 states and 385016 transitions. Second operand 4 states. [2019-12-07 14:25:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:31,064 INFO L93 Difference]: Finished difference Result 129310 states and 576248 transitions. [2019-12-07 14:25:31,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:25:31,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 14:25:31,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:31,437 INFO L225 Difference]: With dead ends: 129310 [2019-12-07 14:25:31,437 INFO L226 Difference]: Without dead ends: 129254 [2019-12-07 14:25:31,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:25:33,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129254 states. [2019-12-07 14:25:34,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129254 to 124642. [2019-12-07 14:25:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124642 states. [2019-12-07 14:25:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124642 states to 124642 states and 558856 transitions. [2019-12-07 14:25:35,228 INFO L78 Accepts]: Start accepts. Automaton has 124642 states and 558856 transitions. Word has length 15 [2019-12-07 14:25:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:35,228 INFO L462 AbstractCegarLoop]: Abstraction has 124642 states and 558856 transitions. [2019-12-07 14:25:35,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:25:35,228 INFO L276 IsEmpty]: Start isEmpty. Operand 124642 states and 558856 transitions. [2019-12-07 14:25:35,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:25:35,234 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:35,234 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:35,234 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:35,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:35,235 INFO L82 PathProgramCache]: Analyzing trace with hash -545556496, now seen corresponding path program 1 times [2019-12-07 14:25:35,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:35,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747519795] [2019-12-07 14:25:35,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:35,295 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:25:35,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747519795] [2019-12-07 14:25:35,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:35,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:25:35,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520782889] [2019-12-07 14:25:35,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:25:35,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:35,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:25:35,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:25:35,296 INFO L87 Difference]: Start difference. First operand 124642 states and 558856 transitions. Second operand 4 states. [2019-12-07 14:25:36,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:36,512 INFO L93 Difference]: Finished difference Result 158782 states and 702836 transitions. [2019-12-07 14:25:36,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:25:36,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 14:25:36,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:36,940 INFO L225 Difference]: With dead ends: 158782 [2019-12-07 14:25:36,940 INFO L226 Difference]: Without dead ends: 158730 [2019-12-07 14:25:36,940 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:25:38,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158730 states. [2019-12-07 14:25:42,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158730 to 142378. [2019-12-07 14:25:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142378 states. [2019-12-07 14:25:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142378 states to 142378 states and 635380 transitions. [2019-12-07 14:25:43,186 INFO L78 Accepts]: Start accepts. Automaton has 142378 states and 635380 transitions. Word has length 18 [2019-12-07 14:25:43,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:43,186 INFO L462 AbstractCegarLoop]: Abstraction has 142378 states and 635380 transitions. [2019-12-07 14:25:43,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:25:43,186 INFO L276 IsEmpty]: Start isEmpty. Operand 142378 states and 635380 transitions. [2019-12-07 14:25:43,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:25:43,195 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:43,195 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:43,195 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:43,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:43,195 INFO L82 PathProgramCache]: Analyzing trace with hash 267646308, now seen corresponding path program 1 times [2019-12-07 14:25:43,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:43,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259744702] [2019-12-07 14:25:43,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:43,222 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:25:43,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259744702] [2019-12-07 14:25:43,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:43,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:25:43,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775152106] [2019-12-07 14:25:43,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:25:43,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:43,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:25:43,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:25:43,224 INFO L87 Difference]: Start difference. First operand 142378 states and 635380 transitions. Second operand 3 states. [2019-12-07 14:25:44,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:44,454 INFO L93 Difference]: Finished difference Result 243978 states and 1046540 transitions. [2019-12-07 14:25:44,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:25:44,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 14:25:44,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:45,163 INFO L225 Difference]: With dead ends: 243978 [2019-12-07 14:25:45,163 INFO L226 Difference]: Without dead ends: 243978 [2019-12-07 14:25:45,164 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:25:47,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243978 states. [2019-12-07 14:25:53,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243978 to 220082. [2019-12-07 14:25:53,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220082 states. [2019-12-07 14:25:54,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220082 states to 220082 states and 955428 transitions. [2019-12-07 14:25:54,150 INFO L78 Accepts]: Start accepts. Automaton has 220082 states and 955428 transitions. Word has length 19 [2019-12-07 14:25:54,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:54,150 INFO L462 AbstractCegarLoop]: Abstraction has 220082 states and 955428 transitions. [2019-12-07 14:25:54,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:25:54,150 INFO L276 IsEmpty]: Start isEmpty. Operand 220082 states and 955428 transitions. [2019-12-07 14:25:54,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:25:54,163 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:54,163 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:54,163 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:54,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:54,163 INFO L82 PathProgramCache]: Analyzing trace with hash -993922956, now seen corresponding path program 1 times [2019-12-07 14:25:54,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:54,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846014572] [2019-12-07 14:25:54,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:54,223 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:25:54,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846014572] [2019-12-07 14:25:54,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:54,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:25:54,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347203236] [2019-12-07 14:25:54,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:25:54,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:54,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:25:54,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:25:54,224 INFO L87 Difference]: Start difference. First operand 220082 states and 955428 transitions. Second operand 3 states. [2019-12-07 14:25:56,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:56,192 INFO L93 Difference]: Finished difference Result 329247 states and 1365659 transitions. [2019-12-07 14:25:56,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:25:56,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 14:25:56,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:57,080 INFO L225 Difference]: With dead ends: 329247 [2019-12-07 14:25:57,081 INFO L226 Difference]: Without dead ends: 328713 [2019-12-07 14:25:57,081 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:25:59,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328713 states. [2019-12-07 14:26:07,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328713 to 319924. [2019-12-07 14:26:07,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319924 states. [2019-12-07 14:26:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319924 states to 319924 states and 1338763 transitions. [2019-12-07 14:26:08,905 INFO L78 Accepts]: Start accepts. Automaton has 319924 states and 1338763 transitions. Word has length 20 [2019-12-07 14:26:08,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:08,906 INFO L462 AbstractCegarLoop]: Abstraction has 319924 states and 1338763 transitions. [2019-12-07 14:26:08,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:26:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 319924 states and 1338763 transitions. [2019-12-07 14:26:08,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 14:26:08,926 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:08,926 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] [2019-12-07 14:26:08,926 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:08,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:08,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1767153122, now seen corresponding path program 1 times [2019-12-07 14:26:08,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:26:08,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059140660] [2019-12-07 14:26:08,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:08,989 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:26:08,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059140660] [2019-12-07 14:26:08,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:26:08,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:26:08,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294449770] [2019-12-07 14:26:08,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:26:08,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:26:08,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:26:08,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:26:08,990 INFO L87 Difference]: Start difference. First operand 319924 states and 1338763 transitions. Second operand 4 states. [2019-12-07 14:26:11,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:11,054 INFO L93 Difference]: Finished difference Result 328458 states and 1362857 transitions. [2019-12-07 14:26:11,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:26:11,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 14:26:11,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:11,954 INFO L225 Difference]: With dead ends: 328458 [2019-12-07 14:26:11,954 INFO L226 Difference]: Without dead ends: 328458 [2019-12-07 14:26:11,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:26:15,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328458 states. [2019-12-07 14:26:20,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328458 to 319797. [2019-12-07 14:26:20,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319797 states. [2019-12-07 14:26:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319797 states to 319797 states and 1338212 transitions. [2019-12-07 14:26:27,409 INFO L78 Accepts]: Start accepts. Automaton has 319797 states and 1338212 transitions. Word has length 21 [2019-12-07 14:26:27,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:27,409 INFO L462 AbstractCegarLoop]: Abstraction has 319797 states and 1338212 transitions. [2019-12-07 14:26:27,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:26:27,409 INFO L276 IsEmpty]: Start isEmpty. Operand 319797 states and 1338212 transitions. [2019-12-07 14:26:27,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 14:26:27,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:27,432 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] [2019-12-07 14:26:27,432 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:27,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:27,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1950965462, now seen corresponding path program 1 times [2019-12-07 14:26:27,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:26:27,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823780103] [2019-12-07 14:26:27,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:27,467 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:26:27,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823780103] [2019-12-07 14:26:27,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:26:27,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:26:27,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671234332] [2019-12-07 14:26:27,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:26:27,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:26:27,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:26:27,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:26:27,468 INFO L87 Difference]: Start difference. First operand 319797 states and 1338212 transitions. Second operand 4 states. [2019-12-07 14:26:29,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:29,949 INFO L93 Difference]: Finished difference Result 397517 states and 1642646 transitions. [2019-12-07 14:26:29,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:26:29,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 14:26:29,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:31,072 INFO L225 Difference]: With dead ends: 397517 [2019-12-07 14:26:31,072 INFO L226 Difference]: Without dead ends: 397449 [2019-12-07 14:26:31,073 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:26:34,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397449 states. [2019-12-07 14:26:39,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397449 to 324789. [2019-12-07 14:26:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324789 states. [2019-12-07 14:26:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324789 states to 324789 states and 1358610 transitions. [2019-12-07 14:26:41,097 INFO L78 Accepts]: Start accepts. Automaton has 324789 states and 1358610 transitions. Word has length 21 [2019-12-07 14:26:41,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:41,097 INFO L462 AbstractCegarLoop]: Abstraction has 324789 states and 1358610 transitions. [2019-12-07 14:26:41,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:26:41,097 INFO L276 IsEmpty]: Start isEmpty. Operand 324789 states and 1358610 transitions. [2019-12-07 14:26:41,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 14:26:41,119 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:41,119 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] [2019-12-07 14:26:41,119 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:41,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:41,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1200354078, now seen corresponding path program 1 times [2019-12-07 14:26:41,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:26:41,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780116580] [2019-12-07 14:26:41,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:41,179 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:26:41,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780116580] [2019-12-07 14:26:41,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:26:41,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:26:41,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153246720] [2019-12-07 14:26:41,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:26:41,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:26:41,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:26:41,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:26:41,180 INFO L87 Difference]: Start difference. First operand 324789 states and 1358610 transitions. Second operand 4 states. [2019-12-07 14:26:42,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:42,674 INFO L93 Difference]: Finished difference Result 315314 states and 1312350 transitions. [2019-12-07 14:26:42,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:26:42,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 14:26:42,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:47,125 INFO L225 Difference]: With dead ends: 315314 [2019-12-07 14:26:47,125 INFO L226 Difference]: Without dead ends: 315314 [2019-12-07 14:26:47,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:26:49,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315314 states. [2019-12-07 14:26:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315314 to 241748. [2019-12-07 14:26:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241748 states. [2019-12-07 14:26:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241748 states to 241748 states and 1028512 transitions. [2019-12-07 14:26:54,694 INFO L78 Accepts]: Start accepts. Automaton has 241748 states and 1028512 transitions. Word has length 21 [2019-12-07 14:26:54,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:54,694 INFO L462 AbstractCegarLoop]: Abstraction has 241748 states and 1028512 transitions. [2019-12-07 14:26:54,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:26:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 241748 states and 1028512 transitions. [2019-12-07 14:26:54,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 14:26:54,728 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:54,728 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] [2019-12-07 14:26:54,729 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:54,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:54,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1910405908, now seen corresponding path program 1 times [2019-12-07 14:26:54,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:26:54,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520270883] [2019-12-07 14:26:54,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:54,767 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:26:54,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520270883] [2019-12-07 14:26:54,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:26:54,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:26:54,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476540972] [2019-12-07 14:26:54,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:26:54,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:26:54,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:26:54,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:26:54,769 INFO L87 Difference]: Start difference. First operand 241748 states and 1028512 transitions. Second operand 4 states. [2019-12-07 14:26:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:55,662 INFO L93 Difference]: Finished difference Result 206887 states and 812603 transitions. [2019-12-07 14:26:55,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:26:55,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 14:26:55,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:56,123 INFO L225 Difference]: With dead ends: 206887 [2019-12-07 14:26:56,123 INFO L226 Difference]: Without dead ends: 191315 [2019-12-07 14:26:56,124 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:26:58,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191315 states. [2019-12-07 14:27:00,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191315 to 191315. [2019-12-07 14:27:00,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191315 states. [2019-12-07 14:27:01,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191315 states to 191315 states and 758331 transitions. [2019-12-07 14:27:01,238 INFO L78 Accepts]: Start accepts. Automaton has 191315 states and 758331 transitions. Word has length 24 [2019-12-07 14:27:01,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:27:01,238 INFO L462 AbstractCegarLoop]: Abstraction has 191315 states and 758331 transitions. [2019-12-07 14:27:01,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:27:01,238 INFO L276 IsEmpty]: Start isEmpty. Operand 191315 states and 758331 transitions. [2019-12-07 14:27:01,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 14:27:01,264 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:27:01,264 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] [2019-12-07 14:27:01,264 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:27:01,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:27:01,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1761806270, now seen corresponding path program 1 times [2019-12-07 14:27:01,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:27:01,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779619716] [2019-12-07 14:27:01,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:27:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:01,312 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:27:01,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779619716] [2019-12-07 14:27:01,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:27:01,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:27:01,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624506987] [2019-12-07 14:27:01,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:27:01,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:27:01,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:27:01,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:27:01,313 INFO L87 Difference]: Start difference. First operand 191315 states and 758331 transitions. Second operand 5 states. [2019-12-07 14:27:01,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:27:01,674 INFO L93 Difference]: Finished difference Result 93574 states and 318035 transitions. [2019-12-07 14:27:01,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:27:01,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 14:27:01,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:27:01,822 INFO L225 Difference]: With dead ends: 93574 [2019-12-07 14:27:01,822 INFO L226 Difference]: Without dead ends: 81150 [2019-12-07 14:27:01,822 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:27:02,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81150 states. [2019-12-07 14:27:03,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81150 to 80992. [2019-12-07 14:27:03,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80992 states. [2019-12-07 14:27:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80992 states to 80992 states and 272916 transitions. [2019-12-07 14:27:03,682 INFO L78 Accepts]: Start accepts. Automaton has 80992 states and 272916 transitions. Word has length 25 [2019-12-07 14:27:03,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:27:03,682 INFO L462 AbstractCegarLoop]: Abstraction has 80992 states and 272916 transitions. [2019-12-07 14:27:03,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:27:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 80992 states and 272916 transitions. [2019-12-07 14:27:03,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:27:03,692 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:27:03,692 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] [2019-12-07 14:27:03,692 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:27:03,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:27:03,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1382879271, now seen corresponding path program 1 times [2019-12-07 14:27:03,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:27:03,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439793305] [2019-12-07 14:27:03,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:27:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:03,746 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:27:03,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439793305] [2019-12-07 14:27:03,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:27:03,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:27:03,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178695904] [2019-12-07 14:27:03,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:27:03,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:27:03,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:27:03,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:27:03,748 INFO L87 Difference]: Start difference. First operand 80992 states and 272916 transitions. Second operand 6 states. [2019-12-07 14:27:03,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:27:03,859 INFO L93 Difference]: Finished difference Result 23470 states and 74287 transitions. [2019-12-07 14:27:03,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:27:03,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 14:27:03,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:27:03,885 INFO L225 Difference]: With dead ends: 23470 [2019-12-07 14:27:03,885 INFO L226 Difference]: Without dead ends: 18541 [2019-12-07 14:27:03,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:27:03,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18541 states. [2019-12-07 14:27:04,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18541 to 17502. [2019-12-07 14:27:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17502 states. [2019-12-07 14:27:04,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17502 states to 17502 states and 55011 transitions. [2019-12-07 14:27:04,120 INFO L78 Accepts]: Start accepts. Automaton has 17502 states and 55011 transitions. Word has length 26 [2019-12-07 14:27:04,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:27:04,120 INFO L462 AbstractCegarLoop]: Abstraction has 17502 states and 55011 transitions. [2019-12-07 14:27:04,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:27:04,120 INFO L276 IsEmpty]: Start isEmpty. Operand 17502 states and 55011 transitions. [2019-12-07 14:27:04,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 14:27:04,129 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:27:04,129 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:27:04,129 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:27:04,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:27:04,129 INFO L82 PathProgramCache]: Analyzing trace with hash 617853445, now seen corresponding path program 1 times [2019-12-07 14:27:04,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:27:04,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438715181] [2019-12-07 14:27:04,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:27:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:04,189 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:27:04,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438715181] [2019-12-07 14:27:04,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:27:04,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:27:04,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390023344] [2019-12-07 14:27:04,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:27:04,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:27:04,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:27:04,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:27:04,191 INFO L87 Difference]: Start difference. First operand 17502 states and 55011 transitions. Second operand 7 states. [2019-12-07 14:27:04,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:27:04,296 INFO L93 Difference]: Finished difference Result 14977 states and 48972 transitions. [2019-12-07 14:27:04,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:27:04,297 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-07 14:27:04,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:27:04,315 INFO L225 Difference]: With dead ends: 14977 [2019-12-07 14:27:04,316 INFO L226 Difference]: Without dead ends: 14621 [2019-12-07 14:27:04,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:27:04,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14621 states. [2019-12-07 14:27:04,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14621 to 12994. [2019-12-07 14:27:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12994 states. [2019-12-07 14:27:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12994 states to 12994 states and 43989 transitions. [2019-12-07 14:27:04,507 INFO L78 Accepts]: Start accepts. Automaton has 12994 states and 43989 transitions. Word has length 34 [2019-12-07 14:27:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:27:04,507 INFO L462 AbstractCegarLoop]: Abstraction has 12994 states and 43989 transitions. [2019-12-07 14:27:04,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:27:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 12994 states and 43989 transitions. [2019-12-07 14:27:04,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 14:27:04,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:27:04,521 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:04,521 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:27:04,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:27:04,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1992238470, now seen corresponding path program 1 times [2019-12-07 14:27:04,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:27:04,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231536607] [2019-12-07 14:27:04,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:27:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:04,576 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:27:04,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231536607] [2019-12-07 14:27:04,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:27:04,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:27:04,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302541362] [2019-12-07 14:27:04,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:27:04,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:27:04,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:27:04,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:27:04,577 INFO L87 Difference]: Start difference. First operand 12994 states and 43989 transitions. Second operand 3 states. [2019-12-07 14:27:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:27:04,619 INFO L93 Difference]: Finished difference Result 12993 states and 43987 transitions. [2019-12-07 14:27:04,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:27:04,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-07 14:27:04,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:27:04,637 INFO L225 Difference]: With dead ends: 12993 [2019-12-07 14:27:04,637 INFO L226 Difference]: Without dead ends: 12993 [2019-12-07 14:27:04,637 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:27:04,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12993 states. [2019-12-07 14:27:04,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12993 to 12642. [2019-12-07 14:27:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12642 states. [2019-12-07 14:27:04,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12642 states to 12642 states and 43006 transitions. [2019-12-07 14:27:04,979 INFO L78 Accepts]: Start accepts. Automaton has 12642 states and 43006 transitions. Word has length 64 [2019-12-07 14:27:04,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:27:04,979 INFO L462 AbstractCegarLoop]: Abstraction has 12642 states and 43006 transitions. [2019-12-07 14:27:04,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:27:04,979 INFO L276 IsEmpty]: Start isEmpty. Operand 12642 states and 43006 transitions. [2019-12-07 14:27:04,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 14:27:04,993 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:27:04,993 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] [2019-12-07 14:27:04,993 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:27:04,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:27:04,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1029868635, now seen corresponding path program 1 times [2019-12-07 14:27:04,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:27:04,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954534966] [2019-12-07 14:27:04,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:27:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:05,043 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:27:05,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954534966] [2019-12-07 14:27:05,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:27:05,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:27:05,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489029233] [2019-12-07 14:27:05,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:27:05,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:27:05,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:27:05,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:27:05,045 INFO L87 Difference]: Start difference. First operand 12642 states and 43006 transitions. Second operand 4 states. [2019-12-07 14:27:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:27:05,102 INFO L93 Difference]: Finished difference Result 14183 states and 47236 transitions. [2019-12-07 14:27:05,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:27:05,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 14:27:05,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:27:05,113 INFO L225 Difference]: With dead ends: 14183 [2019-12-07 14:27:05,113 INFO L226 Difference]: Without dead ends: 7876 [2019-12-07 14:27:05,113 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:27:05,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7876 states. [2019-12-07 14:27:05,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7876 to 7876. [2019-12-07 14:27:05,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7876 states. [2019-12-07 14:27:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7876 states to 7876 states and 24168 transitions. [2019-12-07 14:27:05,209 INFO L78 Accepts]: Start accepts. Automaton has 7876 states and 24168 transitions. Word has length 65 [2019-12-07 14:27:05,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:27:05,209 INFO L462 AbstractCegarLoop]: Abstraction has 7876 states and 24168 transitions. [2019-12-07 14:27:05,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:27:05,209 INFO L276 IsEmpty]: Start isEmpty. Operand 7876 states and 24168 transitions. [2019-12-07 14:27:05,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 14:27:05,215 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:27:05,215 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] [2019-12-07 14:27:05,216 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:27:05,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:27:05,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1100404435, now seen corresponding path program 2 times [2019-12-07 14:27:05,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:27:05,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676948593] [2019-12-07 14:27:05,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:27:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:05,301 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:27:05,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676948593] [2019-12-07 14:27:05,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:27:05,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:27:05,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518128440] [2019-12-07 14:27:05,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:27:05,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:27:05,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:27:05,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:27:05,302 INFO L87 Difference]: Start difference. First operand 7876 states and 24168 transitions. Second operand 7 states. [2019-12-07 14:27:05,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:27:05,515 INFO L93 Difference]: Finished difference Result 21973 states and 67328 transitions. [2019-12-07 14:27:05,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 14:27:05,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-07 14:27:05,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:27:05,534 INFO L225 Difference]: With dead ends: 21973 [2019-12-07 14:27:05,534 INFO L226 Difference]: Without dead ends: 16542 [2019-12-07 14:27:05,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:27:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16542 states. [2019-12-07 14:27:05,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16542 to 11762. [2019-12-07 14:27:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11762 states. [2019-12-07 14:27:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11762 states to 11762 states and 35753 transitions. [2019-12-07 14:27:05,714 INFO L78 Accepts]: Start accepts. Automaton has 11762 states and 35753 transitions. Word has length 65 [2019-12-07 14:27:05,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:27:05,715 INFO L462 AbstractCegarLoop]: Abstraction has 11762 states and 35753 transitions. [2019-12-07 14:27:05,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:27:05,715 INFO L276 IsEmpty]: Start isEmpty. Operand 11762 states and 35753 transitions. [2019-12-07 14:27:05,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 14:27:05,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:27:05,725 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] [2019-12-07 14:27:05,725 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:27:05,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:27:05,726 INFO L82 PathProgramCache]: Analyzing trace with hash 376720393, now seen corresponding path program 3 times [2019-12-07 14:27:05,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:27:05,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908785337] [2019-12-07 14:27:05,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:27:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:05,776 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:27:05,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908785337] [2019-12-07 14:27:05,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:27:05,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:27:05,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601682028] [2019-12-07 14:27:05,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:27:05,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:27:05,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:27:05,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:27:05,777 INFO L87 Difference]: Start difference. First operand 11762 states and 35753 transitions. Second operand 4 states. [2019-12-07 14:27:05,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:27:05,827 INFO L93 Difference]: Finished difference Result 12556 states and 37536 transitions. [2019-12-07 14:27:05,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:27:05,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 14:27:05,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:27:05,833 INFO L225 Difference]: With dead ends: 12556 [2019-12-07 14:27:05,833 INFO L226 Difference]: Without dead ends: 4598 [2019-12-07 14:27:05,834 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:27:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4598 states. [2019-12-07 14:27:05,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4598 to 4598. [2019-12-07 14:27:05,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4598 states. [2019-12-07 14:27:05,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4598 states to 4598 states and 12323 transitions. [2019-12-07 14:27:05,888 INFO L78 Accepts]: Start accepts. Automaton has 4598 states and 12323 transitions. Word has length 65 [2019-12-07 14:27:05,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:27:05,888 INFO L462 AbstractCegarLoop]: Abstraction has 4598 states and 12323 transitions. [2019-12-07 14:27:05,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:27:05,888 INFO L276 IsEmpty]: Start isEmpty. Operand 4598 states and 12323 transitions. [2019-12-07 14:27:05,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:27:05,892 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:27:05,892 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] [2019-12-07 14:27:05,892 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:27:05,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:27:05,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1473700222, now seen corresponding path program 1 times [2019-12-07 14:27:05,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:27:05,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810491188] [2019-12-07 14:27:05,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:27:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:05,943 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:27:05,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810491188] [2019-12-07 14:27:05,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:27:05,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:27:05,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652521502] [2019-12-07 14:27:05,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:27:05,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:27:05,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:27:05,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:27:05,944 INFO L87 Difference]: Start difference. First operand 4598 states and 12323 transitions. Second operand 4 states. [2019-12-07 14:27:05,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:27:05,964 INFO L93 Difference]: Finished difference Result 5071 states and 13379 transitions. [2019-12-07 14:27:05,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:27:05,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 14:27:05,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:27:05,965 INFO L225 Difference]: With dead ends: 5071 [2019-12-07 14:27:05,965 INFO L226 Difference]: Without dead ends: 555 [2019-12-07 14:27:05,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:27:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-12-07 14:27:05,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-12-07 14:27:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-12-07 14:27:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1183 transitions. [2019-12-07 14:27:05,970 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1183 transitions. Word has length 66 [2019-12-07 14:27:05,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:27:05,970 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 1183 transitions. [2019-12-07 14:27:05,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:27:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1183 transitions. [2019-12-07 14:27:05,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:27:05,970 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:27:05,970 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] [2019-12-07 14:27:05,970 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:27:05,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:27:05,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1960507102, now seen corresponding path program 2 times [2019-12-07 14:27:05,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:27:05,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790784846] [2019-12-07 14:27:05,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:27:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:06,045 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:27:06,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790784846] [2019-12-07 14:27:06,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:27:06,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:27:06,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059111304] [2019-12-07 14:27:06,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:27:06,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:27:06,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:27:06,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:27:06,046 INFO L87 Difference]: Start difference. First operand 555 states and 1183 transitions. Second operand 7 states. [2019-12-07 14:27:06,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:27:06,213 INFO L93 Difference]: Finished difference Result 1169 states and 2456 transitions. [2019-12-07 14:27:06,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:27:06,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 14:27:06,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:27:06,214 INFO L225 Difference]: With dead ends: 1169 [2019-12-07 14:27:06,214 INFO L226 Difference]: Without dead ends: 854 [2019-12-07 14:27:06,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:27:06,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-12-07 14:27:06,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 638. [2019-12-07 14:27:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-12-07 14:27:06,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1324 transitions. [2019-12-07 14:27:06,220 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1324 transitions. Word has length 66 [2019-12-07 14:27:06,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:27:06,221 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1324 transitions. [2019-12-07 14:27:06,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:27:06,221 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1324 transitions. [2019-12-07 14:27:06,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:27:06,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:27:06,221 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] [2019-12-07 14:27:06,221 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:27:06,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:27:06,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1469521026, now seen corresponding path program 3 times [2019-12-07 14:27:06,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:27:06,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008945178] [2019-12-07 14:27:06,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:27:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:27:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:27:06,300 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 14:27:06,300 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:27:06,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= v_~z$r_buff0_thd2~0_131 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t533~0.base_34| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t533~0.base_34|) |v_ULTIMATE.start_main_~#t533~0.offset_23| 0)) |v_#memory_int_25|) (= 0 v_~z$flush_delayed~0_223) (= 0 v_~__unbuffered_p3_EAX~0_84) (= |v_#NULL.offset_6| 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t533~0.base_34| 4)) (= v_~z$w_buff1~0_366 0) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= v_~main$tmp_guard1~0_56 0) (= v_~z$r_buff0_thd1~0_132 0) (= 0 v_~z$r_buff1_thd4~0_351) (= |v_ULTIMATE.start_main_~#t533~0.offset_23| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t533~0.base_34|) 0) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (= v_~z$r_buff1_thd0~0_223 0) (= 0 v_~__unbuffered_p2_EAX~0_71) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t533~0.base_34|) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t533~0.base_34| 1)) (< 0 |v_#StackHeapBarrier_20|) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p3_EBX~0_61) (= v_~y~0_94 0) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= v_~weak$$choice2~0_273 0) (= 0 v_~weak$$choice0~0_182) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z~0_310 0) (= 0 v_~__unbuffered_p0_EAX~0_80) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_111|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ULTIMATE.start_main_~#t534~0.offset=|v_ULTIMATE.start_main_~#t534~0.offset_24|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_84, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_71, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ULTIMATE.start_main_~#t534~0.base=|v_ULTIMATE.start_main_~#t534~0.base_36|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ULTIMATE.start_main_~#t536~0.offset=|v_ULTIMATE.start_main_~#t536~0.offset_16|, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_~#t533~0.base=|v_ULTIMATE.start_main_~#t533~0.base_34|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t535~0.offset=|v_ULTIMATE.start_main_~#t535~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_351, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_223, ~y~0=v_~y~0_94, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ULTIMATE.start_main_~#t535~0.base=|v_ULTIMATE.start_main_~#t535~0.base_28|, ULTIMATE.start_main_~#t533~0.offset=|v_ULTIMATE.start_main_~#t533~0.offset_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_61, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_~#t536~0.base=|v_ULTIMATE.start_main_~#t536~0.base_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_310, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t534~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t534~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t536~0.offset, ~z$flush_delayed~0, ULTIMATE.start_main_~#t533~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t535~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t535~0.base, ULTIMATE.start_main_~#t533~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t536~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:27:06,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (= (select |v_#valid_46| |v_ULTIMATE.start_main_~#t534~0.base_11|) 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t534~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t534~0.base_11|) |v_ULTIMATE.start_main_~#t534~0.offset_10| 1)) |v_#memory_int_21|) (= |v_ULTIMATE.start_main_~#t534~0.offset_10| 0) (= (store |v_#valid_46| |v_ULTIMATE.start_main_~#t534~0.base_11| 1) |v_#valid_45|) (not (= |v_ULTIMATE.start_main_~#t534~0.base_11| 0)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t534~0.base_11|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t534~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t534~0.offset=|v_ULTIMATE.start_main_~#t534~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, ULTIMATE.start_main_~#t534~0.base=|v_ULTIMATE.start_main_~#t534~0.base_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t534~0.offset, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t534~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 14:27:06,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t535~0.base_11|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t535~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t535~0.base_11|) |v_ULTIMATE.start_main_~#t535~0.offset_11| 2))) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t535~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t535~0.offset_11|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t535~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t535~0.base_11|)) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t535~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t535~0.offset=|v_ULTIMATE.start_main_~#t535~0.offset_11|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|, ULTIMATE.start_main_~#t535~0.base=|v_ULTIMATE.start_main_~#t535~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t535~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t535~0.base] because there is no mapped edge [2019-12-07 14:27:06,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t536~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t536~0.base_9|) |v_ULTIMATE.start_main_~#t536~0.offset_8| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t536~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t536~0.base_9| 0)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t536~0.base_9|) 0) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t536~0.base_9| 1) |v_#valid_35|) (= 0 |v_ULTIMATE.start_main_~#t536~0.offset_8|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t536~0.base_9| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, ULTIMATE.start_main_~#t536~0.base=|v_ULTIMATE.start_main_~#t536~0.base_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t536~0.offset=|v_ULTIMATE.start_main_~#t536~0.offset_8|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t536~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t536~0.offset, #length] because there is no mapped edge [2019-12-07 14:27:06,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (= ~z$r_buff0_thd3~0_In324030854 ~z$r_buff1_thd3~0_Out324030854) (= ~z$r_buff0_thd0~0_In324030854 ~z$r_buff1_thd0~0_Out324030854) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In324030854)) (= ~z~0_In324030854 ~z$mem_tmp~0_Out324030854) (= ~weak$$choice0~0_Out324030854 |P3Thread1of1ForFork2_#t~nondet26_In324030854|) (= ~z$r_buff1_thd2~0_Out324030854 ~z$r_buff0_thd2~0_In324030854) (= ~weak$$choice2~0_Out324030854 ~z$flush_delayed~0_Out324030854) (= ~z$r_buff0_thd1~0_In324030854 ~z$r_buff1_thd1~0_Out324030854) (= ~z$r_buff0_thd4~0_Out324030854 1) (= ~z$r_buff1_thd4~0_Out324030854 ~z$r_buff0_thd4~0_In324030854) (= ~weak$$choice2~0_Out324030854 |P3Thread1of1ForFork2_#t~nondet27_In324030854|)) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In324030854|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In324030854|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In324030854, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In324030854, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In324030854, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In324030854, ~z~0=~z~0_In324030854, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In324030854, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In324030854} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out324030854|, ~z$mem_tmp~0=~z$mem_tmp~0_Out324030854, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out324030854|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In324030854, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out324030854, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out324030854, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out324030854, ~z$flush_delayed~0=~z$flush_delayed~0_Out324030854, ~weak$$choice0~0=~weak$$choice0~0_Out324030854, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In324030854, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out324030854, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out324030854, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out324030854, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In324030854, ~z~0=~z~0_In324030854, ~weak$$choice2~0=~weak$$choice2~0_Out324030854, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In324030854, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In324030854} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-07 14:27:06,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out-313546918| |P3Thread1of1ForFork2_#t~ite28_Out-313546918|)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-313546918 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-313546918 256)))) (or (and .cse0 (= ~z$w_buff0~0_In-313546918 |P3Thread1of1ForFork2_#t~ite28_Out-313546918|) (not .cse1) (not .cse2)) (and .cse0 (= ~z$w_buff1~0_In-313546918 |P3Thread1of1ForFork2_#t~ite28_Out-313546918|) (or .cse1 .cse2)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-313546918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-313546918, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-313546918, ~z$w_buff1~0=~z$w_buff1~0_In-313546918} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-313546918|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-313546918|, ~z$w_buff0~0=~z$w_buff0~0_In-313546918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-313546918, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-313546918, ~z$w_buff1~0=~z$w_buff1~0_In-313546918} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 14:27:06,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_10|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 14:27:06,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In232769166 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out232769166| ~z$mem_tmp~0_In232769166) (not .cse0)) (and .cse0 (= |P3Thread1of1ForFork2_#t~ite48_Out232769166| ~z~0_In232769166)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In232769166, ~z$flush_delayed~0=~z$flush_delayed~0_In232769166, ~z~0=~z~0_In232769166} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In232769166, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out232769166|, ~z$flush_delayed~0=~z$flush_delayed~0_In232769166, ~z~0=~z~0_In232769166} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 14:27:06,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_10) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_12|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_17 v_~__unbuffered_p0_EAX~0_19)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 14:27:06,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_35 1) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= 1 v_~x~0_8)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_35, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 14:27:06,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1703162264 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1703162264 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-1703162264| ~z$w_buff0_used~0_In-1703162264)) (and (not .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-1703162264| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1703162264, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1703162264} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-1703162264|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1703162264, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1703162264} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 14:27:06,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In554329280 256) 0))) (or (and (= ~z$mem_tmp~0_In554329280 |P2Thread1of1ForFork1_#t~ite25_Out554329280|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out554329280| ~z~0_In554329280)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In554329280, ~z$flush_delayed~0=~z$flush_delayed~0_In554329280, ~z~0=~z~0_In554329280} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In554329280, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out554329280|, ~z$flush_delayed~0=~z$flush_delayed~0_In554329280, ~z~0=~z~0_In554329280} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 14:27:06,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd4~0_In2135930166 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In2135930166 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In2135930166 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In2135930166 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite52_Out2135930166| ~z$w_buff1_used~0_In2135930166)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P3Thread1of1ForFork2_#t~ite52_Out2135930166| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2135930166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2135930166, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2135930166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2135930166} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out2135930166|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2135930166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2135930166, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2135930166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2135930166} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 14:27:06,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1858744388 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1858744388 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_Out-1858744388 ~z$r_buff0_thd4~0_In-1858744388))) (or (and (= ~z$r_buff0_thd4~0_Out-1858744388 0) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1858744388, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1858744388} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-1858744388|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1858744388, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1858744388} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 14:27:06,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-2137026623 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-2137026623 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-2137026623 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-2137026623 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-2137026623| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd4~0_In-2137026623 |P3Thread1of1ForFork2_#t~ite54_Out-2137026623|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2137026623, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2137026623, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2137026623, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2137026623} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-2137026623|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2137026623, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2137026623, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2137026623, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2137026623} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 14:27:06,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_22| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_21|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 14:27:06,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_137) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_36|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 14:27:06,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:27:06,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1612300402 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1612300402 256) 0))) (or (and (= ~z$w_buff1~0_In1612300402 |ULTIMATE.start_main_#t~ite59_Out1612300402|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite59_Out1612300402| ~z~0_In1612300402) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1612300402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1612300402, ~z$w_buff1~0=~z$w_buff1~0_In1612300402, ~z~0=~z~0_In1612300402} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1612300402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1612300402, ~z$w_buff1~0=~z$w_buff1~0_In1612300402, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1612300402|, ~z~0=~z~0_In1612300402} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 14:27:06,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 14:27:06,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1683418705 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1683418705 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-1683418705| 0)) (and (= |ULTIMATE.start_main_#t~ite61_Out-1683418705| ~z$w_buff0_used~0_In-1683418705) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1683418705, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1683418705} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1683418705, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1683418705|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1683418705} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 14:27:06,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In2092126768 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In2092126768 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In2092126768 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In2092126768 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out2092126768| ~z$w_buff1_used~0_In2092126768) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite62_Out2092126768|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2092126768, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2092126768, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2092126768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2092126768} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out2092126768|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2092126768, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2092126768, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2092126768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2092126768} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 14:27:06,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In667193038 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In667193038 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out667193038| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In667193038 |ULTIMATE.start_main_#t~ite63_Out667193038|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In667193038, ~z$w_buff0_used~0=~z$w_buff0_used~0_In667193038} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out667193038|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In667193038, ~z$w_buff0_used~0=~z$w_buff0_used~0_In667193038} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 14:27:06,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1154075606 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1154075606 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1154075606 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1154075606 256)))) (or (and (= ~z$r_buff1_thd0~0_In-1154075606 |ULTIMATE.start_main_#t~ite64_Out-1154075606|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite64_Out-1154075606|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1154075606, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1154075606, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1154075606, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1154075606} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1154075606, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1154075606, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1154075606, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1154075606, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-1154075606|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 14:27:06,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_31) (= 0 v_~__unbuffered_p2_EAX~0_33) (= v_~y~0_56 2) (= 1 v_~__unbuffered_p3_EAX~0_35) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:27:06,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:27:06 BasicIcfg [2019-12-07 14:27:06,389 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:27:06,390 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:27:06,390 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:27:06,390 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:27:06,390 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:25:11" (3/4) ... [2019-12-07 14:27:06,392 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:27:06,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= v_~z$r_buff0_thd2~0_131 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t533~0.base_34| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t533~0.base_34|) |v_ULTIMATE.start_main_~#t533~0.offset_23| 0)) |v_#memory_int_25|) (= 0 v_~z$flush_delayed~0_223) (= 0 v_~__unbuffered_p3_EAX~0_84) (= |v_#NULL.offset_6| 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t533~0.base_34| 4)) (= v_~z$w_buff1~0_366 0) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= v_~main$tmp_guard1~0_56 0) (= v_~z$r_buff0_thd1~0_132 0) (= 0 v_~z$r_buff1_thd4~0_351) (= |v_ULTIMATE.start_main_~#t533~0.offset_23| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t533~0.base_34|) 0) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (= v_~z$r_buff1_thd0~0_223 0) (= 0 v_~__unbuffered_p2_EAX~0_71) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t533~0.base_34|) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t533~0.base_34| 1)) (< 0 |v_#StackHeapBarrier_20|) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p3_EBX~0_61) (= v_~y~0_94 0) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= v_~weak$$choice2~0_273 0) (= 0 v_~weak$$choice0~0_182) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z~0_310 0) (= 0 v_~__unbuffered_p0_EAX~0_80) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_111|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ULTIMATE.start_main_~#t534~0.offset=|v_ULTIMATE.start_main_~#t534~0.offset_24|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_84, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_71, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ULTIMATE.start_main_~#t534~0.base=|v_ULTIMATE.start_main_~#t534~0.base_36|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ULTIMATE.start_main_~#t536~0.offset=|v_ULTIMATE.start_main_~#t536~0.offset_16|, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_~#t533~0.base=|v_ULTIMATE.start_main_~#t533~0.base_34|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t535~0.offset=|v_ULTIMATE.start_main_~#t535~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_351, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_223, ~y~0=v_~y~0_94, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ULTIMATE.start_main_~#t535~0.base=|v_ULTIMATE.start_main_~#t535~0.base_28|, ULTIMATE.start_main_~#t533~0.offset=|v_ULTIMATE.start_main_~#t533~0.offset_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_61, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_~#t536~0.base=|v_ULTIMATE.start_main_~#t536~0.base_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_310, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t534~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t534~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t536~0.offset, ~z$flush_delayed~0, ULTIMATE.start_main_~#t533~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t535~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t535~0.base, ULTIMATE.start_main_~#t533~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t536~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:27:06,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (= (select |v_#valid_46| |v_ULTIMATE.start_main_~#t534~0.base_11|) 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t534~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t534~0.base_11|) |v_ULTIMATE.start_main_~#t534~0.offset_10| 1)) |v_#memory_int_21|) (= |v_ULTIMATE.start_main_~#t534~0.offset_10| 0) (= (store |v_#valid_46| |v_ULTIMATE.start_main_~#t534~0.base_11| 1) |v_#valid_45|) (not (= |v_ULTIMATE.start_main_~#t534~0.base_11| 0)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t534~0.base_11|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t534~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t534~0.offset=|v_ULTIMATE.start_main_~#t534~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, ULTIMATE.start_main_~#t534~0.base=|v_ULTIMATE.start_main_~#t534~0.base_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t534~0.offset, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t534~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 14:27:06,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t535~0.base_11|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t535~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t535~0.base_11|) |v_ULTIMATE.start_main_~#t535~0.offset_11| 2))) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t535~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t535~0.offset_11|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t535~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t535~0.base_11|)) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t535~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t535~0.offset=|v_ULTIMATE.start_main_~#t535~0.offset_11|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|, ULTIMATE.start_main_~#t535~0.base=|v_ULTIMATE.start_main_~#t535~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t535~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t535~0.base] because there is no mapped edge [2019-12-07 14:27:06,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t536~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t536~0.base_9|) |v_ULTIMATE.start_main_~#t536~0.offset_8| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t536~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t536~0.base_9| 0)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t536~0.base_9|) 0) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t536~0.base_9| 1) |v_#valid_35|) (= 0 |v_ULTIMATE.start_main_~#t536~0.offset_8|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t536~0.base_9| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, ULTIMATE.start_main_~#t536~0.base=|v_ULTIMATE.start_main_~#t536~0.base_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t536~0.offset=|v_ULTIMATE.start_main_~#t536~0.offset_8|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t536~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t536~0.offset, #length] because there is no mapped edge [2019-12-07 14:27:06,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (= ~z$r_buff0_thd3~0_In324030854 ~z$r_buff1_thd3~0_Out324030854) (= ~z$r_buff0_thd0~0_In324030854 ~z$r_buff1_thd0~0_Out324030854) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In324030854)) (= ~z~0_In324030854 ~z$mem_tmp~0_Out324030854) (= ~weak$$choice0~0_Out324030854 |P3Thread1of1ForFork2_#t~nondet26_In324030854|) (= ~z$r_buff1_thd2~0_Out324030854 ~z$r_buff0_thd2~0_In324030854) (= ~weak$$choice2~0_Out324030854 ~z$flush_delayed~0_Out324030854) (= ~z$r_buff0_thd1~0_In324030854 ~z$r_buff1_thd1~0_Out324030854) (= ~z$r_buff0_thd4~0_Out324030854 1) (= ~z$r_buff1_thd4~0_Out324030854 ~z$r_buff0_thd4~0_In324030854) (= ~weak$$choice2~0_Out324030854 |P3Thread1of1ForFork2_#t~nondet27_In324030854|)) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In324030854|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In324030854|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In324030854, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In324030854, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In324030854, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In324030854, ~z~0=~z~0_In324030854, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In324030854, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In324030854} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out324030854|, ~z$mem_tmp~0=~z$mem_tmp~0_Out324030854, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out324030854|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In324030854, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out324030854, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out324030854, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out324030854, ~z$flush_delayed~0=~z$flush_delayed~0_Out324030854, ~weak$$choice0~0=~weak$$choice0~0_Out324030854, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In324030854, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out324030854, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out324030854, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out324030854, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In324030854, ~z~0=~z~0_In324030854, ~weak$$choice2~0=~weak$$choice2~0_Out324030854, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In324030854, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In324030854} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-07 14:27:06,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out-313546918| |P3Thread1of1ForFork2_#t~ite28_Out-313546918|)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-313546918 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-313546918 256)))) (or (and .cse0 (= ~z$w_buff0~0_In-313546918 |P3Thread1of1ForFork2_#t~ite28_Out-313546918|) (not .cse1) (not .cse2)) (and .cse0 (= ~z$w_buff1~0_In-313546918 |P3Thread1of1ForFork2_#t~ite28_Out-313546918|) (or .cse1 .cse2)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-313546918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-313546918, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-313546918, ~z$w_buff1~0=~z$w_buff1~0_In-313546918} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-313546918|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-313546918|, ~z$w_buff0~0=~z$w_buff0~0_In-313546918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-313546918, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-313546918, ~z$w_buff1~0=~z$w_buff1~0_In-313546918} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 14:27:06,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_10|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 14:27:06,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In232769166 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out232769166| ~z$mem_tmp~0_In232769166) (not .cse0)) (and .cse0 (= |P3Thread1of1ForFork2_#t~ite48_Out232769166| ~z~0_In232769166)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In232769166, ~z$flush_delayed~0=~z$flush_delayed~0_In232769166, ~z~0=~z~0_In232769166} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In232769166, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out232769166|, ~z$flush_delayed~0=~z$flush_delayed~0_In232769166, ~z~0=~z~0_In232769166} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 14:27:06,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_10) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_12|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_17 v_~__unbuffered_p0_EAX~0_19)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 14:27:06,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_35 1) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= 1 v_~x~0_8)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_35, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 14:27:06,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1703162264 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1703162264 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-1703162264| ~z$w_buff0_used~0_In-1703162264)) (and (not .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-1703162264| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1703162264, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1703162264} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-1703162264|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1703162264, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1703162264} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 14:27:06,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In554329280 256) 0))) (or (and (= ~z$mem_tmp~0_In554329280 |P2Thread1of1ForFork1_#t~ite25_Out554329280|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out554329280| ~z~0_In554329280)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In554329280, ~z$flush_delayed~0=~z$flush_delayed~0_In554329280, ~z~0=~z~0_In554329280} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In554329280, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out554329280|, ~z$flush_delayed~0=~z$flush_delayed~0_In554329280, ~z~0=~z~0_In554329280} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 14:27:06,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd4~0_In2135930166 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In2135930166 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In2135930166 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In2135930166 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite52_Out2135930166| ~z$w_buff1_used~0_In2135930166)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P3Thread1of1ForFork2_#t~ite52_Out2135930166| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2135930166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2135930166, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2135930166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2135930166} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out2135930166|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2135930166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2135930166, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2135930166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2135930166} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 14:27:06,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1858744388 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1858744388 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_Out-1858744388 ~z$r_buff0_thd4~0_In-1858744388))) (or (and (= ~z$r_buff0_thd4~0_Out-1858744388 0) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1858744388, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1858744388} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-1858744388|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1858744388, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1858744388} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 14:27:06,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-2137026623 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-2137026623 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-2137026623 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-2137026623 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-2137026623| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd4~0_In-2137026623 |P3Thread1of1ForFork2_#t~ite54_Out-2137026623|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2137026623, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2137026623, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2137026623, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2137026623} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-2137026623|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2137026623, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2137026623, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2137026623, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2137026623} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 14:27:06,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_22| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_21|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 14:27:06,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_137) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_36|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 14:27:06,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:27:06,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1612300402 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1612300402 256) 0))) (or (and (= ~z$w_buff1~0_In1612300402 |ULTIMATE.start_main_#t~ite59_Out1612300402|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite59_Out1612300402| ~z~0_In1612300402) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1612300402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1612300402, ~z$w_buff1~0=~z$w_buff1~0_In1612300402, ~z~0=~z~0_In1612300402} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1612300402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1612300402, ~z$w_buff1~0=~z$w_buff1~0_In1612300402, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1612300402|, ~z~0=~z~0_In1612300402} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 14:27:06,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 14:27:06,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1683418705 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1683418705 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-1683418705| 0)) (and (= |ULTIMATE.start_main_#t~ite61_Out-1683418705| ~z$w_buff0_used~0_In-1683418705) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1683418705, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1683418705} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1683418705, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1683418705|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1683418705} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 14:27:06,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In2092126768 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In2092126768 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In2092126768 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In2092126768 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out2092126768| ~z$w_buff1_used~0_In2092126768) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite62_Out2092126768|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2092126768, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2092126768, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2092126768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2092126768} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out2092126768|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2092126768, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2092126768, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2092126768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2092126768} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 14:27:06,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In667193038 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In667193038 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out667193038| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In667193038 |ULTIMATE.start_main_#t~ite63_Out667193038|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In667193038, ~z$w_buff0_used~0=~z$w_buff0_used~0_In667193038} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out667193038|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In667193038, ~z$w_buff0_used~0=~z$w_buff0_used~0_In667193038} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 14:27:06,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1154075606 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1154075606 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1154075606 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1154075606 256)))) (or (and (= ~z$r_buff1_thd0~0_In-1154075606 |ULTIMATE.start_main_#t~ite64_Out-1154075606|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite64_Out-1154075606|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1154075606, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1154075606, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1154075606, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1154075606} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1154075606, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1154075606, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1154075606, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1154075606, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-1154075606|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 14:27:06,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_31) (= 0 v_~__unbuffered_p2_EAX~0_33) (= v_~y~0_56 2) (= 1 v_~__unbuffered_p3_EAX~0_35) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:27:06,472 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_461cccf8-347c-4611-94df-f8e4db199921/bin/utaipan/witness.graphml [2019-12-07 14:27:06,472 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:27:06,473 INFO L168 Benchmark]: Toolchain (without parser) took 115659.96 ms. Allocated memory was 1.0 GB in the beginning and 8.6 GB in the end (delta: 7.6 GB). Free memory was 932.7 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 5.4 GB. Max. memory is 11.5 GB. [2019-12-07 14:27:06,474 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:27:06,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 455.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 932.7 MB in the beginning and 1.1 GB in the end (delta: -128.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:27:06,474 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.70 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:27:06,474 INFO L168 Benchmark]: Boogie Preprocessor took 27.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:27:06,475 INFO L168 Benchmark]: RCFGBuilder took 452.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 993.8 MB in the end (delta: 62.2 MB). Peak memory consumption was 62.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:27:06,475 INFO L168 Benchmark]: TraceAbstraction took 114597.01 ms. Allocated memory was 1.1 GB in the beginning and 8.6 GB in the end (delta: 7.5 GB). Free memory was 993.8 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 5.4 GB. Max. memory is 11.5 GB. [2019-12-07 14:27:06,475 INFO L168 Benchmark]: Witness Printer took 82.75 ms. Allocated memory is still 8.6 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:27:06,477 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 455.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 932.7 MB in the beginning and 1.1 GB in the end (delta: -128.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.70 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 452.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 993.8 MB in the end (delta: 62.2 MB). Peak memory consumption was 62.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 114597.01 ms. Allocated memory was 1.1 GB in the beginning and 8.6 GB in the end (delta: 7.5 GB). Free memory was 993.8 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 5.4 GB. Max. memory is 11.5 GB. * Witness Printer took 82.75 ms. Allocated memory is still 8.6 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 211 ProgramPointsBefore, 112 ProgramPointsAfterwards, 254 TransitionsBefore, 131 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 29 ChoiceCompositions, 11182 VarBasedMoverChecksPositive, 338 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 381 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 142340 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L851] FCALL, FORK 0 pthread_create(&t533, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t534, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t535, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t536, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 1 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L813] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L814] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L815] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L816] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L817] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L820] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z = z$flush_delayed ? z$mem_tmp : z [L822] 4 z$flush_delayed = (_Bool)0 [L825] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L829] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L830] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L865] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L866] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 2 error locations. Result: UNSAFE, OverallTime: 114.4s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 25.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3373 SDtfs, 5144 SDslu, 5358 SDs, 0 SdLazy, 1062 SolverSat, 189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=324789occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 75.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 216707 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 710 NumberOfCodeBlocks, 710 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 626 ConstructedInterpolants, 0 QuantifiedInterpolants, 175330 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...