./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe024_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_92ae3a65-8341-4689-8082-3fa20409ff05/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_92ae3a65-8341-4689-8082-3fa20409ff05/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_92ae3a65-8341-4689-8082-3fa20409ff05/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_92ae3a65-8341-4689-8082-3fa20409ff05/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe024_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_92ae3a65-8341-4689-8082-3fa20409ff05/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_92ae3a65-8341-4689-8082-3fa20409ff05/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 d8ee9361f952001523e18e33df3cc1597a21c4c8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 19:27:48,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:27:48,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:27:48,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:27:48,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:27:48,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:27:48,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:27:48,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:27:48,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:27:48,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:27:48,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:27:48,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:27:48,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:27:48,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:27:48,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:27:48,173 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:27:48,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:27:48,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:27:48,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:27:48,176 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:27:48,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:27:48,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:27:48,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:27:48,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:27:48,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:27:48,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:27:48,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:27:48,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:27:48,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:27:48,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:27:48,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:27:48,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:27:48,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:27:48,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:27:48,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:27:48,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:27:48,185 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:27:48,185 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:27:48,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:27:48,186 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:27:48,186 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:27:48,187 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_92ae3a65-8341-4689-8082-3fa20409ff05/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:27:48,196 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:27:48,196 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:27:48,197 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:27:48,197 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:27:48,197 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:27:48,197 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:27:48,197 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:27:48,197 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:27:48,198 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:27:48,198 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:27:48,198 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:27:48,198 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:27:48,198 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:27:48,198 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:27:48,198 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:27:48,199 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:27:48,199 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:27:48,199 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:27:48,199 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:27:48,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:27:48,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:27:48,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:27:48,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:27:48,200 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:27:48,200 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:27:48,200 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:27:48,200 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:27:48,200 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:27:48,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:27:48,200 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:27:48,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:27:48,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:27:48,201 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:27:48,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:27:48,201 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:27:48,201 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:27:48,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:27:48,201 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:27:48,201 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:27:48,201 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:27:48,201 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_92ae3a65-8341-4689-8082-3fa20409ff05/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 -> d8ee9361f952001523e18e33df3cc1597a21c4c8 [2019-12-07 19:27:48,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:27:48,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:27:48,308 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:27:48,309 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:27:48,309 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:27:48,310 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_92ae3a65-8341-4689-8082-3fa20409ff05/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe024_pso.oepc.i [2019-12-07 19:27:48,347 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_92ae3a65-8341-4689-8082-3fa20409ff05/bin/utaipan/data/f8444dfc0/9071ab7d68854914925f9ccfb6659c6e/FLAGb5554c850 [2019-12-07 19:27:48,842 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:27:48,843 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_92ae3a65-8341-4689-8082-3fa20409ff05/sv-benchmarks/c/pthread-wmm/safe024_pso.oepc.i [2019-12-07 19:27:48,855 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_92ae3a65-8341-4689-8082-3fa20409ff05/bin/utaipan/data/f8444dfc0/9071ab7d68854914925f9ccfb6659c6e/FLAGb5554c850 [2019-12-07 19:27:48,864 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_92ae3a65-8341-4689-8082-3fa20409ff05/bin/utaipan/data/f8444dfc0/9071ab7d68854914925f9ccfb6659c6e [2019-12-07 19:27:48,866 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:27:48,867 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:27:48,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:27:48,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:27:48,870 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:27:48,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:27:48" (1/1) ... [2019-12-07 19:27:48,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:48, skipping insertion in model container [2019-12-07 19:27:48,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:27:48" (1/1) ... [2019-12-07 19:27:48,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:27:48,906 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:27:49,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:27:49,147 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:27:49,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:27:49,232 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:27:49,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:49 WrapperNode [2019-12-07 19:27:49,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:27:49,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:27:49,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:27:49,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:27:49,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:49" (1/1) ... [2019-12-07 19:27:49,251 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:49" (1/1) ... [2019-12-07 19:27:49,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:27:49,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:27:49,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:27:49,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:27:49,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:49" (1/1) ... [2019-12-07 19:27:49,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:49" (1/1) ... [2019-12-07 19:27:49,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:49" (1/1) ... [2019-12-07 19:27:49,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:49" (1/1) ... [2019-12-07 19:27:49,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:49" (1/1) ... [2019-12-07 19:27:49,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:49" (1/1) ... [2019-12-07 19:27:49,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:49" (1/1) ... [2019-12-07 19:27:49,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:27:49,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:27:49,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:27:49,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:27:49,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92ae3a65-8341-4689-8082-3fa20409ff05/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 19:27:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:27:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 19:27:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:27:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:27:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 19:27:49,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 19:27:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 19:27:49,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 19:27:49,336 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 19:27:49,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 19:27:49,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 19:27:49,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:27:49,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:27:49,337 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 19:27:49,701 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:27:49,701 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 19:27:49,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:27:49 BoogieIcfgContainer [2019-12-07 19:27:49,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:27:49,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:27:49,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:27:49,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:27:49,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:27:48" (1/3) ... [2019-12-07 19:27:49,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518ff3ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:27:49, skipping insertion in model container [2019-12-07 19:27:49,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:49" (2/3) ... [2019-12-07 19:27:49,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518ff3ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:27:49, skipping insertion in model container [2019-12-07 19:27:49,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:27:49" (3/3) ... [2019-12-07 19:27:49,707 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_pso.oepc.i [2019-12-07 19:27:49,713 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 19:27:49,713 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:27:49,717 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 19:27:49,718 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 19:27:49,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,742 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,743 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,754 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,754 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,754 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,754 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,754 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,758 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,758 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:49,771 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 19:27:49,784 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:27:49,784 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:27:49,784 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:27:49,784 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:27:49,784 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:27:49,784 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:27:49,784 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:27:49,784 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:27:49,795 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-07 19:27:49,797 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 19:27:49,849 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 19:27:49,849 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:27:49,859 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 726 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 19:27:49,873 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 19:27:49,901 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 19:27:49,901 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:27:49,906 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 726 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 19:27:49,919 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 19:27:49,920 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 19:27:53,020 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 19:27:53,107 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-07 19:27:53,107 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-07 19:27:53,110 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-07 19:28:03,092 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-07 19:28:03,093 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-07 19:28:03,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 19:28:03,097 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:03,097 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 19:28:03,098 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:03,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:03,101 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-07 19:28:03,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:03,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823350748] [2019-12-07 19:28:03,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:03,248 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 19:28:03,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823350748] [2019-12-07 19:28:03,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:03,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:28:03,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028782811] [2019-12-07 19:28:03,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:28:03,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:03,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:28:03,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:28:03,263 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-07 19:28:04,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:04,007 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-07 19:28:04,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:28:04,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 19:28:04,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:04,418 INFO L225 Difference]: With dead ends: 87834 [2019-12-07 19:28:04,418 INFO L226 Difference]: Without dead ends: 82738 [2019-12-07 19:28:04,419 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 19:28:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-07 19:28:08,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-07 19:28:08,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-07 19:28:09,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-07 19:28:09,453 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-07 19:28:09,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:09,453 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-07 19:28:09,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:28:09,453 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-07 19:28:09,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:28:09,460 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:09,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:28:09,461 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:09,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:09,461 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-07 19:28:09,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:09,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823634118] [2019-12-07 19:28:09,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:09,545 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 19:28:09,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823634118] [2019-12-07 19:28:09,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:09,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:28:09,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176915689] [2019-12-07 19:28:09,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:28:09,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:09,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:28:09,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:28:09,547 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-07 19:28:10,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:10,266 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-07 19:28:10,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:28:10,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 19:28:10,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:10,670 INFO L225 Difference]: With dead ends: 127286 [2019-12-07 19:28:10,670 INFO L226 Difference]: Without dead ends: 127202 [2019-12-07 19:28:10,671 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 19:28:16,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-07 19:28:17,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-07 19:28:17,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-07 19:28:18,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-07 19:28:18,207 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-07 19:28:18,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:18,208 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-07 19:28:18,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:28:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-07 19:28:18,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:28:18,211 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:18,211 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:28:18,211 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:18,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:18,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-07 19:28:18,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:18,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094593687] [2019-12-07 19:28:18,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:18,249 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 19:28:18,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094593687] [2019-12-07 19:28:18,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:18,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:28:18,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465269711] [2019-12-07 19:28:18,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:28:18,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:18,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:28:18,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:28:18,250 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-07 19:28:18,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:18,604 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-07 19:28:18,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:28:18,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 19:28:18,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:18,647 INFO L225 Difference]: With dead ends: 28492 [2019-12-07 19:28:18,647 INFO L226 Difference]: Without dead ends: 28492 [2019-12-07 19:28:18,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:28:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-07 19:28:19,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-07 19:28:19,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-07 19:28:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-07 19:28:19,136 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-07 19:28:19,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:19,137 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-07 19:28:19,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:28:19,137 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-07 19:28:19,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:28:19,138 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:19,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:28:19,138 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:19,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:19,139 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-07 19:28:19,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:19,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996019910] [2019-12-07 19:28:19,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:19,195 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 19:28:19,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996019910] [2019-12-07 19:28:19,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:19,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:28:19,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652876896] [2019-12-07 19:28:19,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:28:19,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:19,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:28:19,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:28:19,196 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-07 19:28:19,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:19,507 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-07 19:28:19,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:28:19,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 19:28:19,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:19,571 INFO L225 Difference]: With dead ends: 41156 [2019-12-07 19:28:19,571 INFO L226 Difference]: Without dead ends: 41141 [2019-12-07 19:28:19,571 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 19:28:19,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-07 19:28:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-07 19:28:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-07 19:28:20,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-07 19:28:20,184 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-07 19:28:20,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:20,184 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-07 19:28:20,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:28:20,184 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-07 19:28:20,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:28:20,192 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:20,192 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] [2019-12-07 19:28:20,192 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:20,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:20,193 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-07 19:28:20,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:20,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301742062] [2019-12-07 19:28:20,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:20,265 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 19:28:20,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301742062] [2019-12-07 19:28:20,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:20,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:28:20,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91593791] [2019-12-07 19:28:20,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:28:20,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:20,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:28:20,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:28:20,266 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 6 states. [2019-12-07 19:28:20,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:20,823 INFO L93 Difference]: Finished difference Result 48363 states and 157775 transitions. [2019-12-07 19:28:20,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:28:20,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 19:28:20,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:20,901 INFO L225 Difference]: With dead ends: 48363 [2019-12-07 19:28:20,901 INFO L226 Difference]: Without dead ends: 48336 [2019-12-07 19:28:20,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:28:21,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-07 19:28:21,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 33272. [2019-12-07 19:28:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-07 19:28:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 109841 transitions. [2019-12-07 19:28:21,810 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 109841 transitions. Word has length 22 [2019-12-07 19:28:21,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:21,810 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 109841 transitions. [2019-12-07 19:28:21,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:28:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 109841 transitions. [2019-12-07 19:28:21,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 19:28:21,824 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:21,825 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 19:28:21,825 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:21,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:21,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-07 19:28:21,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:21,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533608766] [2019-12-07 19:28:21,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:21,871 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 19:28:21,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533608766] [2019-12-07 19:28:21,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:21,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:28:21,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540479220] [2019-12-07 19:28:21,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:28:21,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:21,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:28:21,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:28:21,873 INFO L87 Difference]: Start difference. First operand 33272 states and 109841 transitions. Second operand 4 states. [2019-12-07 19:28:21,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:21,930 INFO L93 Difference]: Finished difference Result 12861 states and 39176 transitions. [2019-12-07 19:28:21,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:28:21,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 19:28:21,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:21,947 INFO L225 Difference]: With dead ends: 12861 [2019-12-07 19:28:21,947 INFO L226 Difference]: Without dead ends: 12861 [2019-12-07 19:28:21,947 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 19:28:21,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-12-07 19:28:22,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12721. [2019-12-07 19:28:22,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12721 states. [2019-12-07 19:28:22,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12721 states to 12721 states and 38766 transitions. [2019-12-07 19:28:22,126 INFO L78 Accepts]: Start accepts. Automaton has 12721 states and 38766 transitions. Word has length 25 [2019-12-07 19:28:22,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:22,126 INFO L462 AbstractCegarLoop]: Abstraction has 12721 states and 38766 transitions. [2019-12-07 19:28:22,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:28:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 12721 states and 38766 transitions. [2019-12-07 19:28:22,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 19:28:22,142 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:22,143 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] [2019-12-07 19:28:22,143 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:22,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:22,143 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-07 19:28:22,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:22,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040614960] [2019-12-07 19:28:22,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:22,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 19:28:22,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040614960] [2019-12-07 19:28:22,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:22,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:28:22,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329205272] [2019-12-07 19:28:22,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:28:22,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:22,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:28:22,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:28:22,190 INFO L87 Difference]: Start difference. First operand 12721 states and 38766 transitions. Second operand 5 states. [2019-12-07 19:28:22,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:22,248 INFO L93 Difference]: Finished difference Result 11425 states and 35436 transitions. [2019-12-07 19:28:22,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:28:22,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 19:28:22,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:22,266 INFO L225 Difference]: With dead ends: 11425 [2019-12-07 19:28:22,266 INFO L226 Difference]: Without dead ends: 11425 [2019-12-07 19:28:22,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:28:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11425 states. [2019-12-07 19:28:22,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11425 to 10977. [2019-12-07 19:28:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10977 states. [2019-12-07 19:28:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10977 states to 10977 states and 34172 transitions. [2019-12-07 19:28:22,429 INFO L78 Accepts]: Start accepts. Automaton has 10977 states and 34172 transitions. Word has length 39 [2019-12-07 19:28:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:22,429 INFO L462 AbstractCegarLoop]: Abstraction has 10977 states and 34172 transitions. [2019-12-07 19:28:22,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:28:22,429 INFO L276 IsEmpty]: Start isEmpty. Operand 10977 states and 34172 transitions. [2019-12-07 19:28:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 19:28:22,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:22,444 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] [2019-12-07 19:28:22,444 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:22,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:22,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829373, now seen corresponding path program 1 times [2019-12-07 19:28:22,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:22,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550798031] [2019-12-07 19:28:22,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:22,510 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 19:28:22,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550798031] [2019-12-07 19:28:22,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:22,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:28:22,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985811536] [2019-12-07 19:28:22,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:28:22,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:22,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:28:22,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:28:22,511 INFO L87 Difference]: Start difference. First operand 10977 states and 34172 transitions. Second operand 5 states. [2019-12-07 19:28:22,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:22,791 INFO L93 Difference]: Finished difference Result 15852 states and 48728 transitions. [2019-12-07 19:28:22,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:28:22,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-07 19:28:22,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:22,810 INFO L225 Difference]: With dead ends: 15852 [2019-12-07 19:28:22,810 INFO L226 Difference]: Without dead ends: 15852 [2019-12-07 19:28:22,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:28:22,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15852 states. [2019-12-07 19:28:23,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15852 to 14457. [2019-12-07 19:28:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14457 states. [2019-12-07 19:28:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14457 states to 14457 states and 44700 transitions. [2019-12-07 19:28:23,028 INFO L78 Accepts]: Start accepts. Automaton has 14457 states and 44700 transitions. Word has length 53 [2019-12-07 19:28:23,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:23,028 INFO L462 AbstractCegarLoop]: Abstraction has 14457 states and 44700 transitions. [2019-12-07 19:28:23,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:28:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 14457 states and 44700 transitions. [2019-12-07 19:28:23,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 19:28:23,048 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:23,049 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] [2019-12-07 19:28:23,049 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:23,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:23,049 INFO L82 PathProgramCache]: Analyzing trace with hash 194850767, now seen corresponding path program 2 times [2019-12-07 19:28:23,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:23,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784624057] [2019-12-07 19:28:23,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:23,109 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 19:28:23,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784624057] [2019-12-07 19:28:23,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:23,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:28:23,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431972257] [2019-12-07 19:28:23,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:28:23,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:23,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:28:23,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:28:23,111 INFO L87 Difference]: Start difference. First operand 14457 states and 44700 transitions. Second operand 6 states. [2019-12-07 19:28:23,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:23,510 INFO L93 Difference]: Finished difference Result 25137 states and 77688 transitions. [2019-12-07 19:28:23,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:28:23,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-07 19:28:23,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:23,545 INFO L225 Difference]: With dead ends: 25137 [2019-12-07 19:28:23,545 INFO L226 Difference]: Without dead ends: 25137 [2019-12-07 19:28:23,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:28:23,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25137 states. [2019-12-07 19:28:23,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25137 to 16137. [2019-12-07 19:28:23,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16137 states. [2019-12-07 19:28:23,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16137 states to 16137 states and 49947 transitions. [2019-12-07 19:28:23,838 INFO L78 Accepts]: Start accepts. Automaton has 16137 states and 49947 transitions. Word has length 53 [2019-12-07 19:28:23,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:23,838 INFO L462 AbstractCegarLoop]: Abstraction has 16137 states and 49947 transitions. [2019-12-07 19:28:23,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:28:23,838 INFO L276 IsEmpty]: Start isEmpty. Operand 16137 states and 49947 transitions. [2019-12-07 19:28:23,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 19:28:23,860 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:23,860 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] [2019-12-07 19:28:23,860 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:23,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:23,860 INFO L82 PathProgramCache]: Analyzing trace with hash 690646521, now seen corresponding path program 3 times [2019-12-07 19:28:23,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:23,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802607207] [2019-12-07 19:28:23,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:23,940 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 19:28:23,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802607207] [2019-12-07 19:28:23,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:23,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:28:23,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021288518] [2019-12-07 19:28:23,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:28:23,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:23,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:28:23,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:28:23,942 INFO L87 Difference]: Start difference. First operand 16137 states and 49947 transitions. Second operand 3 states. [2019-12-07 19:28:23,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:23,997 INFO L93 Difference]: Finished difference Result 16135 states and 49942 transitions. [2019-12-07 19:28:23,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:28:23,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 19:28:23,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:24,016 INFO L225 Difference]: With dead ends: 16135 [2019-12-07 19:28:24,016 INFO L226 Difference]: Without dead ends: 16135 [2019-12-07 19:28:24,016 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 19:28:24,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16135 states. [2019-12-07 19:28:24,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16135 to 14837. [2019-12-07 19:28:24,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14837 states. [2019-12-07 19:28:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14837 states to 14837 states and 46243 transitions. [2019-12-07 19:28:24,274 INFO L78 Accepts]: Start accepts. Automaton has 14837 states and 46243 transitions. Word has length 53 [2019-12-07 19:28:24,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:24,275 INFO L462 AbstractCegarLoop]: Abstraction has 14837 states and 46243 transitions. [2019-12-07 19:28:24,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:28:24,275 INFO L276 IsEmpty]: Start isEmpty. Operand 14837 states and 46243 transitions. [2019-12-07 19:28:24,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:28:24,287 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:24,287 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] [2019-12-07 19:28:24,287 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:24,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:24,287 INFO L82 PathProgramCache]: Analyzing trace with hash 95954180, now seen corresponding path program 1 times [2019-12-07 19:28:24,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:24,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177980616] [2019-12-07 19:28:24,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:24,334 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 19:28:24,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177980616] [2019-12-07 19:28:24,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:24,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:28:24,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790380043] [2019-12-07 19:28:24,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:28:24,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:24,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:28:24,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:28:24,335 INFO L87 Difference]: Start difference. First operand 14837 states and 46243 transitions. Second operand 4 states. [2019-12-07 19:28:24,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:24,398 INFO L93 Difference]: Finished difference Result 26869 states and 83824 transitions. [2019-12-07 19:28:24,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:28:24,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-07 19:28:24,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:24,412 INFO L225 Difference]: With dead ends: 26869 [2019-12-07 19:28:24,413 INFO L226 Difference]: Without dead ends: 12613 [2019-12-07 19:28:24,413 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 19:28:24,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12613 states. [2019-12-07 19:28:24,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12613 to 12613. [2019-12-07 19:28:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12613 states. [2019-12-07 19:28:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12613 states to 12613 states and 39191 transitions. [2019-12-07 19:28:24,598 INFO L78 Accepts]: Start accepts. Automaton has 12613 states and 39191 transitions. Word has length 54 [2019-12-07 19:28:24,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:24,598 INFO L462 AbstractCegarLoop]: Abstraction has 12613 states and 39191 transitions. [2019-12-07 19:28:24,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:28:24,599 INFO L276 IsEmpty]: Start isEmpty. Operand 12613 states and 39191 transitions. [2019-12-07 19:28:24,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:28:24,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:24,611 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] [2019-12-07 19:28:24,612 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:24,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:24,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1323271516, now seen corresponding path program 2 times [2019-12-07 19:28:24,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:24,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947012646] [2019-12-07 19:28:24,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:24,674 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 19:28:24,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947012646] [2019-12-07 19:28:24,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:24,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:28:24,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235619504] [2019-12-07 19:28:24,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:28:24,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:24,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:28:24,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:28:24,675 INFO L87 Difference]: Start difference. First operand 12613 states and 39191 transitions. Second operand 7 states. [2019-12-07 19:28:25,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:25,184 INFO L93 Difference]: Finished difference Result 18101 states and 54949 transitions. [2019-12-07 19:28:25,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 19:28:25,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-07 19:28:25,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:25,203 INFO L225 Difference]: With dead ends: 18101 [2019-12-07 19:28:25,204 INFO L226 Difference]: Without dead ends: 18101 [2019-12-07 19:28:25,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:28:25,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18101 states. [2019-12-07 19:28:25,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18101 to 13255. [2019-12-07 19:28:25,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13255 states. [2019-12-07 19:28:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13255 states to 13255 states and 41064 transitions. [2019-12-07 19:28:25,430 INFO L78 Accepts]: Start accepts. Automaton has 13255 states and 41064 transitions. Word has length 54 [2019-12-07 19:28:25,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:25,430 INFO L462 AbstractCegarLoop]: Abstraction has 13255 states and 41064 transitions. [2019-12-07 19:28:25,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:28:25,431 INFO L276 IsEmpty]: Start isEmpty. Operand 13255 states and 41064 transitions. [2019-12-07 19:28:25,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:28:25,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:25,444 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] [2019-12-07 19:28:25,444 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:25,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:25,444 INFO L82 PathProgramCache]: Analyzing trace with hash -229144546, now seen corresponding path program 3 times [2019-12-07 19:28:25,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:25,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486550442] [2019-12-07 19:28:25,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:25,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:28:25,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486550442] [2019-12-07 19:28:25,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:25,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:28:25,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67834814] [2019-12-07 19:28:25,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:28:25,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:25,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:28:25,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:28:25,515 INFO L87 Difference]: Start difference. First operand 13255 states and 41064 transitions. Second operand 7 states. [2019-12-07 19:28:25,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:25,791 INFO L93 Difference]: Finished difference Result 31843 states and 97787 transitions. [2019-12-07 19:28:25,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:28:25,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-07 19:28:25,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:25,817 INFO L225 Difference]: With dead ends: 31843 [2019-12-07 19:28:25,817 INFO L226 Difference]: Without dead ends: 23881 [2019-12-07 19:28:25,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:28:25,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23881 states. [2019-12-07 19:28:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23881 to 15324. [2019-12-07 19:28:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15324 states. [2019-12-07 19:28:26,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15324 states to 15324 states and 47480 transitions. [2019-12-07 19:28:26,098 INFO L78 Accepts]: Start accepts. Automaton has 15324 states and 47480 transitions. Word has length 54 [2019-12-07 19:28:26,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:26,098 INFO L462 AbstractCegarLoop]: Abstraction has 15324 states and 47480 transitions. [2019-12-07 19:28:26,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:28:26,099 INFO L276 IsEmpty]: Start isEmpty. Operand 15324 states and 47480 transitions. [2019-12-07 19:28:26,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:28:26,114 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:26,114 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] [2019-12-07 19:28:26,114 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:26,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:26,115 INFO L82 PathProgramCache]: Analyzing trace with hash -333290850, now seen corresponding path program 4 times [2019-12-07 19:28:26,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:26,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809426418] [2019-12-07 19:28:26,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:26,175 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 19:28:26,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809426418] [2019-12-07 19:28:26,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:26,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:28:26,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591887086] [2019-12-07 19:28:26,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:28:26,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:26,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:28:26,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:28:26,177 INFO L87 Difference]: Start difference. First operand 15324 states and 47480 transitions. Second operand 7 states. [2019-12-07 19:28:26,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:26,429 INFO L93 Difference]: Finished difference Result 34229 states and 104176 transitions. [2019-12-07 19:28:26,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:28:26,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-07 19:28:26,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:26,460 INFO L225 Difference]: With dead ends: 34229 [2019-12-07 19:28:26,460 INFO L226 Difference]: Without dead ends: 24802 [2019-12-07 19:28:26,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:28:26,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24802 states. [2019-12-07 19:28:26,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24802 to 17163. [2019-12-07 19:28:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17163 states. [2019-12-07 19:28:26,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17163 states to 17163 states and 52962 transitions. [2019-12-07 19:28:26,763 INFO L78 Accepts]: Start accepts. Automaton has 17163 states and 52962 transitions. Word has length 54 [2019-12-07 19:28:26,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:26,764 INFO L462 AbstractCegarLoop]: Abstraction has 17163 states and 52962 transitions. [2019-12-07 19:28:26,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:28:26,764 INFO L276 IsEmpty]: Start isEmpty. Operand 17163 states and 52962 transitions. [2019-12-07 19:28:26,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:28:26,779 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:26,780 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] [2019-12-07 19:28:26,780 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:26,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:26,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1705682102, now seen corresponding path program 5 times [2019-12-07 19:28:26,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:26,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615655622] [2019-12-07 19:28:26,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:26,865 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 19:28:26,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615655622] [2019-12-07 19:28:26,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:26,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:28:26,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012736894] [2019-12-07 19:28:26,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:28:26,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:26,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:28:26,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:28:26,867 INFO L87 Difference]: Start difference. First operand 17163 states and 52962 transitions. Second operand 7 states. [2019-12-07 19:28:27,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:27,120 INFO L93 Difference]: Finished difference Result 34263 states and 105117 transitions. [2019-12-07 19:28:27,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:28:27,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-07 19:28:27,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:27,157 INFO L225 Difference]: With dead ends: 34263 [2019-12-07 19:28:27,157 INFO L226 Difference]: Without dead ends: 30877 [2019-12-07 19:28:27,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:28:27,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30877 states. [2019-12-07 19:28:27,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30877 to 17315. [2019-12-07 19:28:27,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17315 states. [2019-12-07 19:28:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17315 states to 17315 states and 53594 transitions. [2019-12-07 19:28:27,513 INFO L78 Accepts]: Start accepts. Automaton has 17315 states and 53594 transitions. Word has length 54 [2019-12-07 19:28:27,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:27,513 INFO L462 AbstractCegarLoop]: Abstraction has 17315 states and 53594 transitions. [2019-12-07 19:28:27,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:28:27,514 INFO L276 IsEmpty]: Start isEmpty. Operand 17315 states and 53594 transitions. [2019-12-07 19:28:27,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:28:27,531 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:27,531 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] [2019-12-07 19:28:27,532 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:27,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:27,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1458329250, now seen corresponding path program 1 times [2019-12-07 19:28:27,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:27,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250929609] [2019-12-07 19:28:27,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:27,556 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 19:28:27,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250929609] [2019-12-07 19:28:27,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:27,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:28:27,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930031182] [2019-12-07 19:28:27,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:28:27,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:27,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:28:27,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:28:27,557 INFO L87 Difference]: Start difference. First operand 17315 states and 53594 transitions. Second operand 3 states. [2019-12-07 19:28:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:27,673 INFO L93 Difference]: Finished difference Result 24200 states and 75341 transitions. [2019-12-07 19:28:27,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:28:27,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 19:28:27,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:27,702 INFO L225 Difference]: With dead ends: 24200 [2019-12-07 19:28:27,702 INFO L226 Difference]: Without dead ends: 24200 [2019-12-07 19:28:27,702 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 19:28:27,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24200 states. [2019-12-07 19:28:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24200 to 22841. [2019-12-07 19:28:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22841 states. [2019-12-07 19:28:28,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22841 states to 22841 states and 71375 transitions. [2019-12-07 19:28:28,047 INFO L78 Accepts]: Start accepts. Automaton has 22841 states and 71375 transitions. Word has length 54 [2019-12-07 19:28:28,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:28,047 INFO L462 AbstractCegarLoop]: Abstraction has 22841 states and 71375 transitions. [2019-12-07 19:28:28,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:28:28,047 INFO L276 IsEmpty]: Start isEmpty. Operand 22841 states and 71375 transitions. [2019-12-07 19:28:28,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:28:28,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:28,069 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] [2019-12-07 19:28:28,069 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:28,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:28,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1545980158, now seen corresponding path program 6 times [2019-12-07 19:28:28,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:28,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403460503] [2019-12-07 19:28:28,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:28,116 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 19:28:28,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403460503] [2019-12-07 19:28:28,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:28,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:28:28,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803389675] [2019-12-07 19:28:28,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:28:28,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:28,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:28:28,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:28:28,118 INFO L87 Difference]: Start difference. First operand 22841 states and 71375 transitions. Second operand 3 states. [2019-12-07 19:28:28,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:28,165 INFO L93 Difference]: Finished difference Result 16006 states and 49385 transitions. [2019-12-07 19:28:28,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:28:28,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 19:28:28,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:28,183 INFO L225 Difference]: With dead ends: 16006 [2019-12-07 19:28:28,183 INFO L226 Difference]: Without dead ends: 16006 [2019-12-07 19:28:28,183 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 19:28:28,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16006 states. [2019-12-07 19:28:28,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16006 to 15363. [2019-12-07 19:28:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15363 states. [2019-12-07 19:28:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15363 states to 15363 states and 47295 transitions. [2019-12-07 19:28:28,403 INFO L78 Accepts]: Start accepts. Automaton has 15363 states and 47295 transitions. Word has length 54 [2019-12-07 19:28:28,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:28,403 INFO L462 AbstractCegarLoop]: Abstraction has 15363 states and 47295 transitions. [2019-12-07 19:28:28,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:28:28,403 INFO L276 IsEmpty]: Start isEmpty. Operand 15363 states and 47295 transitions. [2019-12-07 19:28:28,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:28:28,417 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:28,417 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:28:28,417 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:28,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:28,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1024706095, now seen corresponding path program 1 times [2019-12-07 19:28:28,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:28,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257965877] [2019-12-07 19:28:28,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:28,551 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 19:28:28,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257965877] [2019-12-07 19:28:28,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:28,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:28:28,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277078645] [2019-12-07 19:28:28,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:28:28,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:28,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:28:28,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:28:28,552 INFO L87 Difference]: Start difference. First operand 15363 states and 47295 transitions. Second operand 11 states. [2019-12-07 19:28:29,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:29,164 INFO L93 Difference]: Finished difference Result 30972 states and 95508 transitions. [2019-12-07 19:28:29,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 19:28:29,164 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 19:28:29,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:29,201 INFO L225 Difference]: With dead ends: 30972 [2019-12-07 19:28:29,201 INFO L226 Difference]: Without dead ends: 30406 [2019-12-07 19:28:29,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-07 19:28:29,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30406 states. [2019-12-07 19:28:29,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30406 to 19850. [2019-12-07 19:28:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19850 states. [2019-12-07 19:28:29,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19850 states to 19850 states and 61165 transitions. [2019-12-07 19:28:29,565 INFO L78 Accepts]: Start accepts. Automaton has 19850 states and 61165 transitions. Word has length 55 [2019-12-07 19:28:29,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:29,565 INFO L462 AbstractCegarLoop]: Abstraction has 19850 states and 61165 transitions. [2019-12-07 19:28:29,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:28:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 19850 states and 61165 transitions. [2019-12-07 19:28:29,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:28:29,582 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:29,583 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:28:29,583 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:29,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:29,583 INFO L82 PathProgramCache]: Analyzing trace with hash 621327827, now seen corresponding path program 2 times [2019-12-07 19:28:29,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:29,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377961525] [2019-12-07 19:28:29,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:29,705 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 19:28:29,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377961525] [2019-12-07 19:28:29,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:29,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:28:29,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301531642] [2019-12-07 19:28:29,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:28:29,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:29,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:28:29,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:28:29,706 INFO L87 Difference]: Start difference. First operand 19850 states and 61165 transitions. Second operand 11 states. [2019-12-07 19:28:30,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:30,527 INFO L93 Difference]: Finished difference Result 31046 states and 95127 transitions. [2019-12-07 19:28:30,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 19:28:30,528 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 19:28:30,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:30,554 INFO L225 Difference]: With dead ends: 31046 [2019-12-07 19:28:30,554 INFO L226 Difference]: Without dead ends: 22951 [2019-12-07 19:28:30,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-07 19:28:30,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22951 states. [2019-12-07 19:28:30,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22951 to 15246. [2019-12-07 19:28:30,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15246 states. [2019-12-07 19:28:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15246 states to 15246 states and 46410 transitions. [2019-12-07 19:28:30,825 INFO L78 Accepts]: Start accepts. Automaton has 15246 states and 46410 transitions. Word has length 55 [2019-12-07 19:28:30,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:30,825 INFO L462 AbstractCegarLoop]: Abstraction has 15246 states and 46410 transitions. [2019-12-07 19:28:30,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:28:30,825 INFO L276 IsEmpty]: Start isEmpty. Operand 15246 states and 46410 transitions. [2019-12-07 19:28:30,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:28:30,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:30,840 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:28:30,840 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:30,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:30,840 INFO L82 PathProgramCache]: Analyzing trace with hash -2043347127, now seen corresponding path program 3 times [2019-12-07 19:28:30,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:30,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333339307] [2019-12-07 19:28:30,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:30,947 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 19:28:30,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333339307] [2019-12-07 19:28:30,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:30,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 19:28:30,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818292123] [2019-12-07 19:28:30,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 19:28:30,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:30,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 19:28:30,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:28:30,948 INFO L87 Difference]: Start difference. First operand 15246 states and 46410 transitions. Second operand 12 states. [2019-12-07 19:28:31,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:31,477 INFO L93 Difference]: Finished difference Result 23430 states and 70967 transitions. [2019-12-07 19:28:31,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 19:28:31,477 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-07 19:28:31,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:31,502 INFO L225 Difference]: With dead ends: 23430 [2019-12-07 19:28:31,502 INFO L226 Difference]: Without dead ends: 22761 [2019-12-07 19:28:31,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-07 19:28:31,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22761 states. [2019-12-07 19:28:31,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22761 to 14928. [2019-12-07 19:28:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14928 states. [2019-12-07 19:28:31,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14928 states to 14928 states and 45546 transitions. [2019-12-07 19:28:31,799 INFO L78 Accepts]: Start accepts. Automaton has 14928 states and 45546 transitions. Word has length 55 [2019-12-07 19:28:31,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:31,800 INFO L462 AbstractCegarLoop]: Abstraction has 14928 states and 45546 transitions. [2019-12-07 19:28:31,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 19:28:31,800 INFO L276 IsEmpty]: Start isEmpty. Operand 14928 states and 45546 transitions. [2019-12-07 19:28:31,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:28:31,814 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:31,814 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:28:31,814 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:31,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:31,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 4 times [2019-12-07 19:28:31,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:31,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399880046] [2019-12-07 19:28:31,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:28:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:28:31,895 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:28:31,895 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:28:31,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2351~0.base_24| 1)) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2351~0.base_24|) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2351~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2351~0.base_24|) |v_ULTIMATE.start_main_~#t2351~0.offset_18| 0)) |v_#memory_int_23|) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2351~0.base_24| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2351~0.base_24|)) (= 0 |v_ULTIMATE.start_main_~#t2351~0.offset_18|) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ULTIMATE.start_main_~#t2352~0.offset=|v_ULTIMATE.start_main_~#t2352~0.offset_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ULTIMATE.start_main_~#t2353~0.base=|v_ULTIMATE.start_main_~#t2353~0.base_26|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t2353~0.offset=|v_ULTIMATE.start_main_~#t2353~0.offset_19|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ULTIMATE.start_main_~#t2352~0.base=|v_ULTIMATE.start_main_~#t2352~0.base_26|, ULTIMATE.start_main_~#t2351~0.offset=|v_ULTIMATE.start_main_~#t2351~0.offset_18|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ULTIMATE.start_main_~#t2351~0.base=|v_ULTIMATE.start_main_~#t2351~0.base_24|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2352~0.offset, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2353~0.base, ~x$read_delayed_var~0.base, ULTIMATE.start_main_~#t2353~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2352~0.base, ULTIMATE.start_main_~#t2351~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2351~0.base, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 19:28:31,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2352~0.base_13| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2352~0.base_13| 1)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2352~0.base_13|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2352~0.base_13|) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2352~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2352~0.base_13|) |v_ULTIMATE.start_main_~#t2352~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t2352~0.offset_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2352~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2352~0.offset=|v_ULTIMATE.start_main_~#t2352~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2352~0.base=|v_ULTIMATE.start_main_~#t2352~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2352~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2352~0.base] because there is no mapped edge [2019-12-07 19:28:31,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2353~0.base_13| 1) |v_#valid_38|) (not (= 0 |v_ULTIMATE.start_main_~#t2353~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2353~0.base_13| 4) |v_#length_17|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2353~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2353~0.base_13|) |v_ULTIMATE.start_main_~#t2353~0.offset_11| 2)) |v_#memory_int_17|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2353~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t2353~0.offset_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2353~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2353~0.offset=|v_ULTIMATE.start_main_~#t2353~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2353~0.base=|v_ULTIMATE.start_main_~#t2353~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2353~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2353~0.base] because there is no mapped edge [2019-12-07 19:28:31,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (not (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-779855956 0)) (= 1 ~x$w_buff0~0_Out-779855956) (= P1Thread1of1ForFork0_~arg.base_Out-779855956 |P1Thread1of1ForFork0_#in~arg.base_In-779855956|) (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-779855956 |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-779855956|) (= P1Thread1of1ForFork0_~arg.offset_Out-779855956 |P1Thread1of1ForFork0_#in~arg.offset_In-779855956|) (= ~x$w_buff1~0_Out-779855956 ~x$w_buff0~0_In-779855956) (= 1 ~x$w_buff0_used~0_Out-779855956) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-779855956| (ite (not (and (not (= 0 (mod ~x$w_buff0_used~0_Out-779855956 256))) (not (= 0 (mod ~x$w_buff1_used~0_Out-779855956 256))))) 1 0)) (= ~x$w_buff0_used~0_In-779855956 ~x$w_buff1_used~0_Out-779855956)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-779855956, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-779855956|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-779855956|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-779855956} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-779855956, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-779855956, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-779855956, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-779855956, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-779855956|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-779855956|, ~x$w_buff1~0=~x$w_buff1~0_Out-779855956, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-779855956|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-779855956, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-779855956} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 19:28:31,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1444683561 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1444683561 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out-1444683561| ~x~0_In-1444683561) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out-1444683561| ~x$w_buff1~0_In-1444683561)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1444683561, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1444683561, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1444683561, ~x~0=~x~0_In-1444683561} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1444683561|, ~x$w_buff1~0=~x$w_buff1~0_In-1444683561, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1444683561, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1444683561, ~x~0=~x~0_In-1444683561} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 19:28:31,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_20|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_20|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_19|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_27|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 19:28:31,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In1949139977 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1949139977 256)))) (or (and (= ~x$w_buff0_used~0_In1949139977 |P2Thread1of1ForFork1_#t~ite34_Out1949139977|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite34_Out1949139977| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1949139977, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1949139977} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1949139977|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1949139977, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1949139977} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 19:28:31,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In651495843 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In651495843 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out651495843|) (not .cse1)) (and (= ~x$w_buff0_used~0_In651495843 |P1Thread1of1ForFork0_#t~ite28_Out651495843|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In651495843, ~x$w_buff0_used~0=~x$w_buff0_used~0_In651495843} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In651495843, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out651495843|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In651495843} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 19:28:31,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In800092036 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In800092036 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In800092036 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In800092036 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out800092036| ~x$w_buff1_used~0_In800092036)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out800092036| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In800092036, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In800092036, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In800092036, ~x$w_buff0_used~0=~x$w_buff0_used~0_In800092036} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In800092036, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In800092036, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In800092036, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out800092036|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In800092036} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 19:28:31,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_Out-75425476 ~x$r_buff0_thd2~0_In-75425476)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-75425476 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-75425476 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (not .cse0) (= ~x$r_buff0_thd2~0_Out-75425476 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-75425476, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-75425476} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-75425476|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-75425476, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-75425476} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 19:28:31,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In53374748 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In53374748 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In53374748 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In53374748 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out53374748|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In53374748 |P1Thread1of1ForFork0_#t~ite31_Out53374748|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In53374748, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In53374748, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In53374748, ~x$w_buff0_used~0=~x$w_buff0_used~0_In53374748} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out53374748|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In53374748, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In53374748, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In53374748, ~x$w_buff0_used~0=~x$w_buff0_used~0_In53374748} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 19:28:31,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 19:28:31,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1818477929 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite12_Out-1818477929| ~x$w_buff1~0_In-1818477929) (= |P0Thread1of1ForFork2_#t~ite11_In-1818477929| |P0Thread1of1ForFork2_#t~ite11_Out-1818477929|) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite11_Out-1818477929| ~x$w_buff1~0_In-1818477929) (= |P0Thread1of1ForFork2_#t~ite12_Out-1818477929| |P0Thread1of1ForFork2_#t~ite11_Out-1818477929|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1818477929 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-1818477929 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1818477929 256))) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1818477929 256) 0))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1818477929, ~x$w_buff1~0=~x$w_buff1~0_In-1818477929, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1818477929, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1818477929, ~weak$$choice2~0=~weak$$choice2~0_In-1818477929, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1818477929|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1818477929} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1818477929, ~x$w_buff1~0=~x$w_buff1~0_In-1818477929, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1818477929, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1818477929, ~weak$$choice2~0=~weak$$choice2~0_In-1818477929, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1818477929|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1818477929|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1818477929} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 19:28:31,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In458564793 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In458564793| |P0Thread1of1ForFork2_#t~ite14_Out458564793|) (= ~x$w_buff0_used~0_In458564793 |P0Thread1of1ForFork2_#t~ite15_Out458564793|)) (and (= |P0Thread1of1ForFork2_#t~ite14_Out458564793| ~x$w_buff0_used~0_In458564793) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In458564793 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In458564793 256)) .cse1) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In458564793 256))) (= (mod ~x$w_buff0_used~0_In458564793 256) 0))) (= |P0Thread1of1ForFork2_#t~ite14_Out458564793| |P0Thread1of1ForFork2_#t~ite15_Out458564793|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In458564793, ~x$w_buff1_used~0=~x$w_buff1_used~0_In458564793, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In458564793, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In458564793|, ~weak$$choice2~0=~weak$$choice2~0_In458564793, ~x$w_buff0_used~0=~x$w_buff0_used~0_In458564793} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In458564793, ~x$w_buff1_used~0=~x$w_buff1_used~0_In458564793, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out458564793|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In458564793, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out458564793|, ~weak$$choice2~0=~weak$$choice2~0_In458564793, ~x$w_buff0_used~0=~x$w_buff0_used~0_In458564793} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 19:28:31,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In865079167 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In865079167| |P0Thread1of1ForFork2_#t~ite17_Out865079167|) (= ~x$w_buff1_used~0_In865079167 |P0Thread1of1ForFork2_#t~ite18_Out865079167|)) (and .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In865079167 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In865079167 256) 0) .cse1) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In865079167 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In865079167 256)))) (= |P0Thread1of1ForFork2_#t~ite18_Out865079167| |P0Thread1of1ForFork2_#t~ite17_Out865079167|) (= ~x$w_buff1_used~0_In865079167 |P0Thread1of1ForFork2_#t~ite17_Out865079167|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In865079167, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In865079167|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In865079167, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In865079167, ~weak$$choice2~0=~weak$$choice2~0_In865079167, ~x$w_buff0_used~0=~x$w_buff0_used~0_In865079167} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In865079167, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out865079167|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out865079167|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In865079167, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In865079167, ~weak$$choice2~0=~weak$$choice2~0_In865079167, ~x$w_buff0_used~0=~x$w_buff0_used~0_In865079167} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 19:28:31,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_33|) (= |v_P0Thread1of1ForFork2_#t~ite22_34| |v_P0Thread1of1ForFork2_#t~ite22_33|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (= |v_P0Thread1of1ForFork2_#t~ite23_38| |v_P0Thread1of1ForFork2_#t~ite23_37|) (not (= 0 (mod v_~weak$$choice2~0_142 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_38|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_34|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_33|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_37|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_33|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 19:28:31,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 19:28:31,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-647298868 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-647298868 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-647298868 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-647298868 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-647298868 |P2Thread1of1ForFork1_#t~ite35_Out-647298868|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-647298868|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-647298868, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-647298868, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-647298868, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-647298868} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-647298868|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-647298868, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-647298868, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-647298868, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-647298868} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 19:28:31,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In770114952 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In770114952 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out770114952| ~x$r_buff0_thd3~0_In770114952) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out770114952| 0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In770114952, ~x$w_buff0_used~0=~x$w_buff0_used~0_In770114952} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out770114952|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In770114952, ~x$w_buff0_used~0=~x$w_buff0_used~0_In770114952} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 19:28:31,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-1822479151 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1822479151 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1822479151 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1822479151 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-1822479151|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite37_Out-1822479151| ~x$r_buff1_thd3~0_In-1822479151)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1822479151, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1822479151, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1822479151, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1822479151} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1822479151|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1822479151, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1822479151, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1822479151, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1822479151} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 19:28:31,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_38|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 19:28:31,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_39) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:28:31,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1291729050 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1291729050 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1291729050| ~x~0_In1291729050) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In1291729050 |ULTIMATE.start_main_#t~ite41_Out1291729050|) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1291729050, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1291729050, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1291729050, ~x~0=~x~0_In1291729050} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1291729050|, ~x$w_buff1~0=~x$w_buff1~0_In1291729050, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1291729050, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1291729050, ~x~0=~x~0_In1291729050} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 19:28:31,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 19:28:31,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In536080526 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In536080526 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out536080526| ~x$w_buff0_used~0_In536080526) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out536080526|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In536080526, ~x$w_buff0_used~0=~x$w_buff0_used~0_In536080526} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In536080526, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out536080526|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In536080526} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 19:28:31,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In-1566367458 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1566367458 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1566367458 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1566367458 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1566367458 |ULTIMATE.start_main_#t~ite44_Out-1566367458|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1566367458| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1566367458, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1566367458, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1566367458, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1566367458} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1566367458, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1566367458, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1566367458, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1566367458|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1566367458} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 19:28:31,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-73836390 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-73836390 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In-73836390 |ULTIMATE.start_main_#t~ite45_Out-73836390|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-73836390|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-73836390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-73836390} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-73836390, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-73836390|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-73836390} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 19:28:31,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In223875637 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In223875637 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In223875637 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In223875637 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out223875637|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In223875637 |ULTIMATE.start_main_#t~ite46_Out223875637|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In223875637, ~x$w_buff1_used~0=~x$w_buff1_used~0_In223875637, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In223875637, ~x$w_buff0_used~0=~x$w_buff0_used~0_In223875637} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In223875637, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out223875637|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In223875637, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In223875637, ~x$w_buff0_used~0=~x$w_buff0_used~0_In223875637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 19:28:31,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:28:31,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:28:31 BasicIcfg [2019-12-07 19:28:31,968 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:28:31,968 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:28:31,968 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:28:31,968 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:28:31,969 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:27:49" (3/4) ... [2019-12-07 19:28:31,970 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:28:31,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2351~0.base_24| 1)) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2351~0.base_24|) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2351~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2351~0.base_24|) |v_ULTIMATE.start_main_~#t2351~0.offset_18| 0)) |v_#memory_int_23|) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2351~0.base_24| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2351~0.base_24|)) (= 0 |v_ULTIMATE.start_main_~#t2351~0.offset_18|) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ULTIMATE.start_main_~#t2352~0.offset=|v_ULTIMATE.start_main_~#t2352~0.offset_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ULTIMATE.start_main_~#t2353~0.base=|v_ULTIMATE.start_main_~#t2353~0.base_26|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t2353~0.offset=|v_ULTIMATE.start_main_~#t2353~0.offset_19|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ULTIMATE.start_main_~#t2352~0.base=|v_ULTIMATE.start_main_~#t2352~0.base_26|, ULTIMATE.start_main_~#t2351~0.offset=|v_ULTIMATE.start_main_~#t2351~0.offset_18|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ULTIMATE.start_main_~#t2351~0.base=|v_ULTIMATE.start_main_~#t2351~0.base_24|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2352~0.offset, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2353~0.base, ~x$read_delayed_var~0.base, ULTIMATE.start_main_~#t2353~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2352~0.base, ULTIMATE.start_main_~#t2351~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2351~0.base, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 19:28:31,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2352~0.base_13| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2352~0.base_13| 1)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2352~0.base_13|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2352~0.base_13|) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2352~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2352~0.base_13|) |v_ULTIMATE.start_main_~#t2352~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t2352~0.offset_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2352~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2352~0.offset=|v_ULTIMATE.start_main_~#t2352~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2352~0.base=|v_ULTIMATE.start_main_~#t2352~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2352~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2352~0.base] because there is no mapped edge [2019-12-07 19:28:31,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2353~0.base_13| 1) |v_#valid_38|) (not (= 0 |v_ULTIMATE.start_main_~#t2353~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2353~0.base_13| 4) |v_#length_17|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2353~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2353~0.base_13|) |v_ULTIMATE.start_main_~#t2353~0.offset_11| 2)) |v_#memory_int_17|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2353~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t2353~0.offset_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2353~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2353~0.offset=|v_ULTIMATE.start_main_~#t2353~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2353~0.base=|v_ULTIMATE.start_main_~#t2353~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2353~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2353~0.base] because there is no mapped edge [2019-12-07 19:28:31,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (not (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-779855956 0)) (= 1 ~x$w_buff0~0_Out-779855956) (= P1Thread1of1ForFork0_~arg.base_Out-779855956 |P1Thread1of1ForFork0_#in~arg.base_In-779855956|) (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-779855956 |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-779855956|) (= P1Thread1of1ForFork0_~arg.offset_Out-779855956 |P1Thread1of1ForFork0_#in~arg.offset_In-779855956|) (= ~x$w_buff1~0_Out-779855956 ~x$w_buff0~0_In-779855956) (= 1 ~x$w_buff0_used~0_Out-779855956) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-779855956| (ite (not (and (not (= 0 (mod ~x$w_buff0_used~0_Out-779855956 256))) (not (= 0 (mod ~x$w_buff1_used~0_Out-779855956 256))))) 1 0)) (= ~x$w_buff0_used~0_In-779855956 ~x$w_buff1_used~0_Out-779855956)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-779855956, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-779855956|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-779855956|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-779855956} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-779855956, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-779855956, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-779855956, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-779855956, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-779855956|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-779855956|, ~x$w_buff1~0=~x$w_buff1~0_Out-779855956, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-779855956|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-779855956, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-779855956} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 19:28:31,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1444683561 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1444683561 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out-1444683561| ~x~0_In-1444683561) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out-1444683561| ~x$w_buff1~0_In-1444683561)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1444683561, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1444683561, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1444683561, ~x~0=~x~0_In-1444683561} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1444683561|, ~x$w_buff1~0=~x$w_buff1~0_In-1444683561, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1444683561, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1444683561, ~x~0=~x~0_In-1444683561} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 19:28:31,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_20|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_20|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_19|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_27|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 19:28:31,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In1949139977 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1949139977 256)))) (or (and (= ~x$w_buff0_used~0_In1949139977 |P2Thread1of1ForFork1_#t~ite34_Out1949139977|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite34_Out1949139977| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1949139977, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1949139977} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1949139977|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1949139977, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1949139977} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 19:28:31,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In651495843 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In651495843 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out651495843|) (not .cse1)) (and (= ~x$w_buff0_used~0_In651495843 |P1Thread1of1ForFork0_#t~ite28_Out651495843|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In651495843, ~x$w_buff0_used~0=~x$w_buff0_used~0_In651495843} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In651495843, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out651495843|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In651495843} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 19:28:31,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In800092036 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In800092036 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In800092036 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In800092036 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out800092036| ~x$w_buff1_used~0_In800092036)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out800092036| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In800092036, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In800092036, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In800092036, ~x$w_buff0_used~0=~x$w_buff0_used~0_In800092036} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In800092036, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In800092036, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In800092036, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out800092036|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In800092036} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 19:28:31,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_Out-75425476 ~x$r_buff0_thd2~0_In-75425476)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-75425476 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-75425476 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (not .cse0) (= ~x$r_buff0_thd2~0_Out-75425476 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-75425476, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-75425476} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-75425476|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-75425476, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-75425476} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 19:28:31,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In53374748 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In53374748 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In53374748 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In53374748 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out53374748|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In53374748 |P1Thread1of1ForFork0_#t~ite31_Out53374748|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In53374748, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In53374748, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In53374748, ~x$w_buff0_used~0=~x$w_buff0_used~0_In53374748} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out53374748|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In53374748, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In53374748, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In53374748, ~x$w_buff0_used~0=~x$w_buff0_used~0_In53374748} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 19:28:31,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 19:28:31,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1818477929 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite12_Out-1818477929| ~x$w_buff1~0_In-1818477929) (= |P0Thread1of1ForFork2_#t~ite11_In-1818477929| |P0Thread1of1ForFork2_#t~ite11_Out-1818477929|) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite11_Out-1818477929| ~x$w_buff1~0_In-1818477929) (= |P0Thread1of1ForFork2_#t~ite12_Out-1818477929| |P0Thread1of1ForFork2_#t~ite11_Out-1818477929|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1818477929 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-1818477929 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1818477929 256))) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1818477929 256) 0))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1818477929, ~x$w_buff1~0=~x$w_buff1~0_In-1818477929, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1818477929, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1818477929, ~weak$$choice2~0=~weak$$choice2~0_In-1818477929, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1818477929|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1818477929} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1818477929, ~x$w_buff1~0=~x$w_buff1~0_In-1818477929, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1818477929, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1818477929, ~weak$$choice2~0=~weak$$choice2~0_In-1818477929, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1818477929|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1818477929|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1818477929} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 19:28:31,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In458564793 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In458564793| |P0Thread1of1ForFork2_#t~ite14_Out458564793|) (= ~x$w_buff0_used~0_In458564793 |P0Thread1of1ForFork2_#t~ite15_Out458564793|)) (and (= |P0Thread1of1ForFork2_#t~ite14_Out458564793| ~x$w_buff0_used~0_In458564793) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In458564793 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In458564793 256)) .cse1) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In458564793 256))) (= (mod ~x$w_buff0_used~0_In458564793 256) 0))) (= |P0Thread1of1ForFork2_#t~ite14_Out458564793| |P0Thread1of1ForFork2_#t~ite15_Out458564793|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In458564793, ~x$w_buff1_used~0=~x$w_buff1_used~0_In458564793, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In458564793, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In458564793|, ~weak$$choice2~0=~weak$$choice2~0_In458564793, ~x$w_buff0_used~0=~x$w_buff0_used~0_In458564793} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In458564793, ~x$w_buff1_used~0=~x$w_buff1_used~0_In458564793, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out458564793|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In458564793, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out458564793|, ~weak$$choice2~0=~weak$$choice2~0_In458564793, ~x$w_buff0_used~0=~x$w_buff0_used~0_In458564793} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 19:28:31,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In865079167 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In865079167| |P0Thread1of1ForFork2_#t~ite17_Out865079167|) (= ~x$w_buff1_used~0_In865079167 |P0Thread1of1ForFork2_#t~ite18_Out865079167|)) (and .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In865079167 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In865079167 256) 0) .cse1) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In865079167 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In865079167 256)))) (= |P0Thread1of1ForFork2_#t~ite18_Out865079167| |P0Thread1of1ForFork2_#t~ite17_Out865079167|) (= ~x$w_buff1_used~0_In865079167 |P0Thread1of1ForFork2_#t~ite17_Out865079167|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In865079167, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In865079167|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In865079167, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In865079167, ~weak$$choice2~0=~weak$$choice2~0_In865079167, ~x$w_buff0_used~0=~x$w_buff0_used~0_In865079167} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In865079167, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out865079167|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out865079167|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In865079167, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In865079167, ~weak$$choice2~0=~weak$$choice2~0_In865079167, ~x$w_buff0_used~0=~x$w_buff0_used~0_In865079167} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 19:28:31,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_33|) (= |v_P0Thread1of1ForFork2_#t~ite22_34| |v_P0Thread1of1ForFork2_#t~ite22_33|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (= |v_P0Thread1of1ForFork2_#t~ite23_38| |v_P0Thread1of1ForFork2_#t~ite23_37|) (not (= 0 (mod v_~weak$$choice2~0_142 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_38|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_34|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_33|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_37|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_33|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 19:28:31,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 19:28:31,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-647298868 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-647298868 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-647298868 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-647298868 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-647298868 |P2Thread1of1ForFork1_#t~ite35_Out-647298868|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-647298868|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-647298868, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-647298868, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-647298868, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-647298868} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-647298868|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-647298868, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-647298868, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-647298868, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-647298868} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 19:28:31,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In770114952 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In770114952 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out770114952| ~x$r_buff0_thd3~0_In770114952) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out770114952| 0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In770114952, ~x$w_buff0_used~0=~x$w_buff0_used~0_In770114952} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out770114952|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In770114952, ~x$w_buff0_used~0=~x$w_buff0_used~0_In770114952} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 19:28:31,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-1822479151 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1822479151 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1822479151 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1822479151 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-1822479151|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite37_Out-1822479151| ~x$r_buff1_thd3~0_In-1822479151)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1822479151, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1822479151, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1822479151, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1822479151} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1822479151|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1822479151, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1822479151, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1822479151, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1822479151} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 19:28:31,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_38|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 19:28:31,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_39) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:28:31,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1291729050 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1291729050 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1291729050| ~x~0_In1291729050) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In1291729050 |ULTIMATE.start_main_#t~ite41_Out1291729050|) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1291729050, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1291729050, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1291729050, ~x~0=~x~0_In1291729050} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1291729050|, ~x$w_buff1~0=~x$w_buff1~0_In1291729050, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1291729050, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1291729050, ~x~0=~x~0_In1291729050} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 19:28:31,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 19:28:31,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In536080526 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In536080526 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out536080526| ~x$w_buff0_used~0_In536080526) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out536080526|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In536080526, ~x$w_buff0_used~0=~x$w_buff0_used~0_In536080526} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In536080526, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out536080526|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In536080526} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 19:28:31,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In-1566367458 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1566367458 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1566367458 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1566367458 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1566367458 |ULTIMATE.start_main_#t~ite44_Out-1566367458|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1566367458| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1566367458, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1566367458, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1566367458, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1566367458} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1566367458, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1566367458, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1566367458, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1566367458|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1566367458} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 19:28:31,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-73836390 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-73836390 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In-73836390 |ULTIMATE.start_main_#t~ite45_Out-73836390|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-73836390|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-73836390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-73836390} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-73836390, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-73836390|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-73836390} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 19:28:31,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In223875637 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In223875637 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In223875637 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In223875637 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out223875637|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In223875637 |ULTIMATE.start_main_#t~ite46_Out223875637|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In223875637, ~x$w_buff1_used~0=~x$w_buff1_used~0_In223875637, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In223875637, ~x$w_buff0_used~0=~x$w_buff0_used~0_In223875637} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In223875637, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out223875637|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In223875637, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In223875637, ~x$w_buff0_used~0=~x$w_buff0_used~0_In223875637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 19:28:31,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:28:32,044 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_92ae3a65-8341-4689-8082-3fa20409ff05/bin/utaipan/witness.graphml [2019-12-07 19:28:32,044 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:28:32,045 INFO L168 Benchmark]: Toolchain (without parser) took 43178.53 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 932.7 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-12-07 19:28:32,046 INFO L168 Benchmark]: CDTParser took 0.13 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 19:28:32,046 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 932.7 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:28:32,046 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:28:32,047 INFO L168 Benchmark]: Boogie Preprocessor took 24.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:28:32,047 INFO L168 Benchmark]: RCFGBuilder took 407.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. [2019-12-07 19:28:32,047 INFO L168 Benchmark]: TraceAbstraction took 42264.78 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-12-07 19:28:32,048 INFO L168 Benchmark]: Witness Printer took 76.20 ms. Allocated memory is still 4.8 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. [2019-12-07 19:28:32,050 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.13 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 365.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 932.7 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 407.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42264.78 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 76.20 ms. Allocated memory is still 4.8 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2351, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2352, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2353, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 42.1s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3920 SDtfs, 4793 SDslu, 13047 SDs, 0 SdLazy, 5099 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 33 SyntacticMatches, 15 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 110807 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 888 NumberOfCodeBlocks, 888 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 813 ConstructedInterpolants, 0 QuantifiedInterpolants, 179307 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...