./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_22d8e787-ecc2-43b6-8688-2231d0aa970b/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_22d8e787-ecc2-43b6-8688-2231d0aa970b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_22d8e787-ecc2-43b6-8688-2231d0aa970b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_22d8e787-ecc2-43b6-8688-2231d0aa970b/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_22d8e787-ecc2-43b6-8688-2231d0aa970b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_22d8e787-ecc2-43b6-8688-2231d0aa970b/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 ac54514bebc477ac389e6294bf8af9decc225a8c .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 11:52:58,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:52:58,979 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:52:58,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:52:58,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:52:58,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:52:58,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:52:58,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:52:58,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:52:58,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:52:58,992 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:52:58,993 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:52:58,993 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:52:58,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:52:58,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:52:58,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:52:58,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:52:58,997 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:52:58,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:52:59,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:52:59,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:52:59,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:52:59,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:52:59,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:52:59,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:52:59,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:52:59,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:52:59,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:52:59,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:52:59,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:52:59,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:52:59,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:52:59,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:52:59,007 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:52:59,008 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:52:59,008 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:52:59,009 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:52:59,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:52:59,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:52:59,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:52:59,010 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:52:59,011 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_22d8e787-ecc2-43b6-8688-2231d0aa970b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:52:59,024 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:52:59,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:52:59,025 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:52:59,025 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:52:59,025 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:52:59,026 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:52:59,026 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:52:59,026 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:52:59,026 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:52:59,026 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:52:59,026 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:52:59,027 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:52:59,027 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:52:59,027 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:52:59,027 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:52:59,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:52:59,028 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:52:59,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:52:59,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:52:59,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:52:59,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:52:59,029 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:52:59,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:52:59,029 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:52:59,029 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:52:59,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:52:59,030 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:52:59,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:52:59,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:52:59,030 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:52:59,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:52:59,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:52:59,031 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:52:59,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:52:59,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:52:59,032 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:52:59,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:52:59,032 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:52:59,032 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:52:59,032 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:52:59,032 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_22d8e787-ecc2-43b6-8688-2231d0aa970b/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 -> ac54514bebc477ac389e6294bf8af9decc225a8c [2019-12-07 11:52:59,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:52:59,151 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:52:59,154 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:52:59,156 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:52:59,156 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:52:59,156 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_22d8e787-ecc2-43b6-8688-2231d0aa970b/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix002_rmo.opt.i [2019-12-07 11:52:59,196 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_22d8e787-ecc2-43b6-8688-2231d0aa970b/bin/utaipan/data/101298c00/5a48540c6b1f48888554b7891e71ef3f/FLAG6ee575830 [2019-12-07 11:52:59,665 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:52:59,665 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_22d8e787-ecc2-43b6-8688-2231d0aa970b/sv-benchmarks/c/pthread-wmm/mix002_rmo.opt.i [2019-12-07 11:52:59,675 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_22d8e787-ecc2-43b6-8688-2231d0aa970b/bin/utaipan/data/101298c00/5a48540c6b1f48888554b7891e71ef3f/FLAG6ee575830 [2019-12-07 11:52:59,684 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_22d8e787-ecc2-43b6-8688-2231d0aa970b/bin/utaipan/data/101298c00/5a48540c6b1f48888554b7891e71ef3f [2019-12-07 11:52:59,686 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:52:59,687 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:52:59,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:52:59,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:52:59,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:52:59,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:52:59" (1/1) ... [2019-12-07 11:52:59,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:52:59, skipping insertion in model container [2019-12-07 11:52:59,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:52:59" (1/1) ... [2019-12-07 11:52:59,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:52:59,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:52:59,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:52:59,987 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:53:00,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:53:00,083 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:53:00,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:00 WrapperNode [2019-12-07 11:53:00,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:53:00,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:53:00,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:53:00,084 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:53:00,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:00" (1/1) ... [2019-12-07 11:53:00,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:00" (1/1) ... [2019-12-07 11:53:00,128 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:53:00,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:53:00,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:53:00,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:53:00,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:00" (1/1) ... [2019-12-07 11:53:00,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:00" (1/1) ... [2019-12-07 11:53:00,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:00" (1/1) ... [2019-12-07 11:53:00,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:00" (1/1) ... [2019-12-07 11:53:00,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:00" (1/1) ... [2019-12-07 11:53:00,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:00" (1/1) ... [2019-12-07 11:53:00,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:00" (1/1) ... [2019-12-07 11:53:00,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:53:00,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:53:00,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:53:00,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:53:00,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22d8e787-ecc2-43b6-8688-2231d0aa970b/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 11:53:00,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:53:00,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:53:00,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:53:00,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:53:00,204 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:53:00,205 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:53:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:53:00,205 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:53:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 11:53:00,205 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 11:53:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:53:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:53:00,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:53:00,207 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 11:53:00,613 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:53:00,613 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:53:00,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:53:00 BoogieIcfgContainer [2019-12-07 11:53:00,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:53:00,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:53:00,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:53:00,617 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:53:00,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:52:59" (1/3) ... [2019-12-07 11:53:00,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f175c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:53:00, skipping insertion in model container [2019-12-07 11:53:00,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:00" (2/3) ... [2019-12-07 11:53:00,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f175c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:53:00, skipping insertion in model container [2019-12-07 11:53:00,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:53:00" (3/3) ... [2019-12-07 11:53:00,620 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_rmo.opt.i [2019-12-07 11:53:00,626 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:53:00,626 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:53:00,631 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:53:00,632 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:53:00,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,660 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,660 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,662 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,662 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,678 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,678 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,678 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,679 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,679 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:00,710 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 11:53:00,722 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:53:00,722 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:53:00,723 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:53:00,723 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:53:00,723 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:53:00,723 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:53:00,723 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:53:00,723 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:53:00,733 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 244 transitions [2019-12-07 11:53:00,734 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 198 places, 244 transitions [2019-12-07 11:53:00,810 INFO L134 PetriNetUnfolder]: 56/241 cut-off events. [2019-12-07 11:53:00,810 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:53:00,823 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 241 events. 56/241 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 9/192 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 11:53:00,845 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 198 places, 244 transitions [2019-12-07 11:53:00,887 INFO L134 PetriNetUnfolder]: 56/241 cut-off events. [2019-12-07 11:53:00,887 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:53:00,897 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 241 events. 56/241 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 9/192 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 11:53:00,921 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 11:53:00,922 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:53:04,539 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-12-07 11:53:04,775 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 11:53:04,887 INFO L206 etLargeBlockEncoding]: Checked pairs total: 139722 [2019-12-07 11:53:04,887 INFO L214 etLargeBlockEncoding]: Total number of compositions: 132 [2019-12-07 11:53:04,889 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 127 transitions [2019-12-07 11:53:07,472 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 42030 states. [2019-12-07 11:53:07,474 INFO L276 IsEmpty]: Start isEmpty. Operand 42030 states. [2019-12-07 11:53:07,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 11:53:07,478 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:07,478 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:07,479 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:07,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:07,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1345363696, now seen corresponding path program 1 times [2019-12-07 11:53:07,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:53:07,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584082217] [2019-12-07 11:53:07,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:07,641 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 11:53:07,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584082217] [2019-12-07 11:53:07,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:07,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:53:07,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340156473] [2019-12-07 11:53:07,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:53:07,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:53:07,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:53:07,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:53:07,657 INFO L87 Difference]: Start difference. First operand 42030 states. Second operand 3 states. [2019-12-07 11:53:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:08,035 INFO L93 Difference]: Finished difference Result 41750 states and 172028 transitions. [2019-12-07 11:53:08,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:53:08,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 11:53:08,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:08,255 INFO L225 Difference]: With dead ends: 41750 [2019-12-07 11:53:08,255 INFO L226 Difference]: Without dead ends: 38894 [2019-12-07 11:53:08,256 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 11:53:08,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38894 states. [2019-12-07 11:53:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38894 to 38894. [2019-12-07 11:53:09,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38894 states. [2019-12-07 11:53:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38894 states to 38894 states and 160140 transitions. [2019-12-07 11:53:09,674 INFO L78 Accepts]: Start accepts. Automaton has 38894 states and 160140 transitions. Word has length 7 [2019-12-07 11:53:09,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:09,675 INFO L462 AbstractCegarLoop]: Abstraction has 38894 states and 160140 transitions. [2019-12-07 11:53:09,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:53:09,675 INFO L276 IsEmpty]: Start isEmpty. Operand 38894 states and 160140 transitions. [2019-12-07 11:53:09,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:53:09,681 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:09,681 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:09,681 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:09,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:09,681 INFO L82 PathProgramCache]: Analyzing trace with hash 823513967, now seen corresponding path program 1 times [2019-12-07 11:53:09,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:53:09,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768612172] [2019-12-07 11:53:09,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:09,756 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 11:53:09,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768612172] [2019-12-07 11:53:09,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:09,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:53:09,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532068556] [2019-12-07 11:53:09,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:53:09,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:53:09,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:53:09,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:53:09,758 INFO L87 Difference]: Start difference. First operand 38894 states and 160140 transitions. Second operand 4 states. [2019-12-07 11:53:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:10,373 INFO L93 Difference]: Finished difference Result 61966 states and 244788 transitions. [2019-12-07 11:53:10,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:53:10,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 11:53:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:10,558 INFO L225 Difference]: With dead ends: 61966 [2019-12-07 11:53:10,558 INFO L226 Difference]: Without dead ends: 61934 [2019-12-07 11:53:10,559 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 11:53:11,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61934 states. [2019-12-07 11:53:12,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61934 to 60400. [2019-12-07 11:53:12,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60400 states. [2019-12-07 11:53:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60400 states to 60400 states and 239955 transitions. [2019-12-07 11:53:12,295 INFO L78 Accepts]: Start accepts. Automaton has 60400 states and 239955 transitions. Word has length 13 [2019-12-07 11:53:12,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:12,295 INFO L462 AbstractCegarLoop]: Abstraction has 60400 states and 239955 transitions. [2019-12-07 11:53:12,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:53:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 60400 states and 239955 transitions. [2019-12-07 11:53:12,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:53:12,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:12,300 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:12,300 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:12,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:12,301 INFO L82 PathProgramCache]: Analyzing trace with hash 77685178, now seen corresponding path program 1 times [2019-12-07 11:53:12,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:53:12,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418723361] [2019-12-07 11:53:12,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:12,354 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 11:53:12,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418723361] [2019-12-07 11:53:12,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:12,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:53:12,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117585045] [2019-12-07 11:53:12,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:53:12,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:53:12,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:53:12,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:53:12,355 INFO L87 Difference]: Start difference. First operand 60400 states and 239955 transitions. Second operand 4 states. [2019-12-07 11:53:13,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:13,014 INFO L93 Difference]: Finished difference Result 76452 states and 299517 transitions. [2019-12-07 11:53:13,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:53:13,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 11:53:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:13,193 INFO L225 Difference]: With dead ends: 76452 [2019-12-07 11:53:13,193 INFO L226 Difference]: Without dead ends: 76426 [2019-12-07 11:53:13,193 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 11:53:13,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76426 states. [2019-12-07 11:53:14,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76426 to 68802. [2019-12-07 11:53:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68802 states. [2019-12-07 11:53:15,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68802 states to 68802 states and 271884 transitions. [2019-12-07 11:53:15,123 INFO L78 Accepts]: Start accepts. Automaton has 68802 states and 271884 transitions. Word has length 16 [2019-12-07 11:53:15,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:15,124 INFO L462 AbstractCegarLoop]: Abstraction has 68802 states and 271884 transitions. [2019-12-07 11:53:15,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:53:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 68802 states and 271884 transitions. [2019-12-07 11:53:15,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 11:53:15,129 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:15,129 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:15,129 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:15,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:15,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1886698225, now seen corresponding path program 1 times [2019-12-07 11:53:15,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:53:15,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772619869] [2019-12-07 11:53:15,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:15,156 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 11:53:15,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772619869] [2019-12-07 11:53:15,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:15,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:53:15,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401715131] [2019-12-07 11:53:15,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:53:15,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:53:15,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:53:15,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:53:15,158 INFO L87 Difference]: Start difference. First operand 68802 states and 271884 transitions. Second operand 3 states. [2019-12-07 11:53:15,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:15,868 INFO L93 Difference]: Finished difference Result 116968 states and 442545 transitions. [2019-12-07 11:53:15,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:53:15,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 11:53:15,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:16,145 INFO L225 Difference]: With dead ends: 116968 [2019-12-07 11:53:16,145 INFO L226 Difference]: Without dead ends: 116968 [2019-12-07 11:53:16,146 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 11:53:17,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116968 states. [2019-12-07 11:53:19,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116968 to 104212. [2019-12-07 11:53:19,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104212 states. [2019-12-07 11:53:20,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104212 states to 104212 states and 399885 transitions. [2019-12-07 11:53:20,184 INFO L78 Accepts]: Start accepts. Automaton has 104212 states and 399885 transitions. Word has length 17 [2019-12-07 11:53:20,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:20,184 INFO L462 AbstractCegarLoop]: Abstraction has 104212 states and 399885 transitions. [2019-12-07 11:53:20,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:53:20,185 INFO L276 IsEmpty]: Start isEmpty. Operand 104212 states and 399885 transitions. [2019-12-07 11:53:20,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:53:20,193 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:20,193 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:20,193 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:20,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:20,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1754315208, now seen corresponding path program 1 times [2019-12-07 11:53:20,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:53:20,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37449659] [2019-12-07 11:53:20,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:20,230 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 11:53:20,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37449659] [2019-12-07 11:53:20,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:20,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:53:20,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127550427] [2019-12-07 11:53:20,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:53:20,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:53:20,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:53:20,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:53:20,232 INFO L87 Difference]: Start difference. First operand 104212 states and 399885 transitions. Second operand 3 states. [2019-12-07 11:53:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:20,432 INFO L93 Difference]: Finished difference Result 57368 states and 191630 transitions. [2019-12-07 11:53:20,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:53:20,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 11:53:20,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:20,538 INFO L225 Difference]: With dead ends: 57368 [2019-12-07 11:53:20,538 INFO L226 Difference]: Without dead ends: 57368 [2019-12-07 11:53:20,539 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 11:53:20,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57368 states. [2019-12-07 11:53:21,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57368 to 57368. [2019-12-07 11:53:21,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57368 states. [2019-12-07 11:53:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57368 states to 57368 states and 191630 transitions. [2019-12-07 11:53:21,899 INFO L78 Accepts]: Start accepts. Automaton has 57368 states and 191630 transitions. Word has length 18 [2019-12-07 11:53:21,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:21,899 INFO L462 AbstractCegarLoop]: Abstraction has 57368 states and 191630 transitions. [2019-12-07 11:53:21,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:53:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 57368 states and 191630 transitions. [2019-12-07 11:53:21,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:53:21,905 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:21,905 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:21,906 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:21,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:21,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1903393538, now seen corresponding path program 1 times [2019-12-07 11:53:21,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:53:21,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861830779] [2019-12-07 11:53:21,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:21,956 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 11:53:21,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861830779] [2019-12-07 11:53:21,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:21,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:53:21,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138163411] [2019-12-07 11:53:21,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:53:21,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:53:21,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:53:21,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:53:21,958 INFO L87 Difference]: Start difference. First operand 57368 states and 191630 transitions. Second operand 3 states. [2019-12-07 11:53:22,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:22,162 INFO L93 Difference]: Finished difference Result 57368 states and 189042 transitions. [2019-12-07 11:53:22,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:53:22,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 11:53:22,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:22,268 INFO L225 Difference]: With dead ends: 57368 [2019-12-07 11:53:22,268 INFO L226 Difference]: Without dead ends: 57368 [2019-12-07 11:53:22,269 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 11:53:22,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57368 states. [2019-12-07 11:53:23,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57368 to 56683. [2019-12-07 11:53:23,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56683 states. [2019-12-07 11:53:23,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56683 states to 56683 states and 187059 transitions. [2019-12-07 11:53:23,433 INFO L78 Accepts]: Start accepts. Automaton has 56683 states and 187059 transitions. Word has length 19 [2019-12-07 11:53:23,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:23,433 INFO L462 AbstractCegarLoop]: Abstraction has 56683 states and 187059 transitions. [2019-12-07 11:53:23,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:53:23,434 INFO L276 IsEmpty]: Start isEmpty. Operand 56683 states and 187059 transitions. [2019-12-07 11:53:23,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:53:23,437 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:23,437 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:23,437 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:23,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:23,437 INFO L82 PathProgramCache]: Analyzing trace with hash -620191314, now seen corresponding path program 1 times [2019-12-07 11:53:23,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:53:23,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324219271] [2019-12-07 11:53:23,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:23,471 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 11:53:23,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324219271] [2019-12-07 11:53:23,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:23,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:53:23,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623986021] [2019-12-07 11:53:23,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:53:23,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:53:23,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:53:23,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:53:23,473 INFO L87 Difference]: Start difference. First operand 56683 states and 187059 transitions. Second operand 4 states. [2019-12-07 11:53:23,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:23,511 INFO L93 Difference]: Finished difference Result 8176 states and 22619 transitions. [2019-12-07 11:53:23,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:53:23,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 11:53:23,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:23,521 INFO L225 Difference]: With dead ends: 8176 [2019-12-07 11:53:23,521 INFO L226 Difference]: Without dead ends: 8176 [2019-12-07 11:53:23,521 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 11:53:23,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8176 states. [2019-12-07 11:53:23,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8176 to 8176. [2019-12-07 11:53:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8176 states. [2019-12-07 11:53:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8176 states to 8176 states and 22619 transitions. [2019-12-07 11:53:23,629 INFO L78 Accepts]: Start accepts. Automaton has 8176 states and 22619 transitions. Word has length 19 [2019-12-07 11:53:23,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:23,629 INFO L462 AbstractCegarLoop]: Abstraction has 8176 states and 22619 transitions. [2019-12-07 11:53:23,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:53:23,629 INFO L276 IsEmpty]: Start isEmpty. Operand 8176 states and 22619 transitions. [2019-12-07 11:53:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:53:23,631 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:23,631 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:23,631 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:23,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:23,632 INFO L82 PathProgramCache]: Analyzing trace with hash 365892370, now seen corresponding path program 1 times [2019-12-07 11:53:23,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:53:23,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829185693] [2019-12-07 11:53:23,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:23,677 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 11:53:23,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829185693] [2019-12-07 11:53:23,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:23,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:53:23,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211259301] [2019-12-07 11:53:23,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:53:23,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:53:23,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:53:23,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:53:23,679 INFO L87 Difference]: Start difference. First operand 8176 states and 22619 transitions. Second operand 4 states. [2019-12-07 11:53:23,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:23,863 INFO L93 Difference]: Finished difference Result 10377 states and 28179 transitions. [2019-12-07 11:53:23,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:53:23,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 11:53:23,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:23,875 INFO L225 Difference]: With dead ends: 10377 [2019-12-07 11:53:23,875 INFO L226 Difference]: Without dead ends: 10377 [2019-12-07 11:53:23,875 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 11:53:23,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10377 states. [2019-12-07 11:53:23,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10377 to 8186. [2019-12-07 11:53:23,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8186 states. [2019-12-07 11:53:24,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8186 states to 8186 states and 22651 transitions. [2019-12-07 11:53:24,007 INFO L78 Accepts]: Start accepts. Automaton has 8186 states and 22651 transitions. Word has length 19 [2019-12-07 11:53:24,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:24,007 INFO L462 AbstractCegarLoop]: Abstraction has 8186 states and 22651 transitions. [2019-12-07 11:53:24,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:53:24,007 INFO L276 IsEmpty]: Start isEmpty. Operand 8186 states and 22651 transitions. [2019-12-07 11:53:24,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 11:53:24,014 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:24,014 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:24,014 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:24,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:24,014 INFO L82 PathProgramCache]: Analyzing trace with hash 49455905, now seen corresponding path program 1 times [2019-12-07 11:53:24,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:53:24,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721188494] [2019-12-07 11:53:24,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:24,052 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 11:53:24,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721188494] [2019-12-07 11:53:24,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:24,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:53:24,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153336999] [2019-12-07 11:53:24,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:53:24,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:53:24,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:53:24,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:53:24,054 INFO L87 Difference]: Start difference. First operand 8186 states and 22651 transitions. Second operand 5 states. [2019-12-07 11:53:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:24,097 INFO L93 Difference]: Finished difference Result 6326 states and 18384 transitions. [2019-12-07 11:53:24,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:53:24,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 11:53:24,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:24,105 INFO L225 Difference]: With dead ends: 6326 [2019-12-07 11:53:24,106 INFO L226 Difference]: Without dead ends: 6326 [2019-12-07 11:53:24,106 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 11:53:24,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6326 states. [2019-12-07 11:53:24,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6326 to 6326. [2019-12-07 11:53:24,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6326 states. [2019-12-07 11:53:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6326 states to 6326 states and 18384 transitions. [2019-12-07 11:53:24,309 INFO L78 Accepts]: Start accepts. Automaton has 6326 states and 18384 transitions. Word has length 31 [2019-12-07 11:53:24,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:24,309 INFO L462 AbstractCegarLoop]: Abstraction has 6326 states and 18384 transitions. [2019-12-07 11:53:24,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:53:24,309 INFO L276 IsEmpty]: Start isEmpty. Operand 6326 states and 18384 transitions. [2019-12-07 11:53:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:53:24,318 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:24,318 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:24,318 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:24,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:24,318 INFO L82 PathProgramCache]: Analyzing trace with hash 14672455, now seen corresponding path program 1 times [2019-12-07 11:53:24,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:53:24,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164970981] [2019-12-07 11:53:24,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:24,390 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 11:53:24,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164970981] [2019-12-07 11:53:24,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:24,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:53:24,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010750035] [2019-12-07 11:53:24,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:53:24,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:53:24,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:53:24,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:53:24,391 INFO L87 Difference]: Start difference. First operand 6326 states and 18384 transitions. Second operand 4 states. [2019-12-07 11:53:24,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:24,551 INFO L93 Difference]: Finished difference Result 7200 states and 20621 transitions. [2019-12-07 11:53:24,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:53:24,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 11:53:24,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:24,559 INFO L225 Difference]: With dead ends: 7200 [2019-12-07 11:53:24,559 INFO L226 Difference]: Without dead ends: 7200 [2019-12-07 11:53:24,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 11:53:24,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7200 states. [2019-12-07 11:53:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7200 to 6848. [2019-12-07 11:53:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6848 states. [2019-12-07 11:53:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6848 states to 6848 states and 19717 transitions. [2019-12-07 11:53:24,637 INFO L78 Accepts]: Start accepts. Automaton has 6848 states and 19717 transitions. Word has length 62 [2019-12-07 11:53:24,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:24,637 INFO L462 AbstractCegarLoop]: Abstraction has 6848 states and 19717 transitions. [2019-12-07 11:53:24,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:53:24,637 INFO L276 IsEmpty]: Start isEmpty. Operand 6848 states and 19717 transitions. [2019-12-07 11:53:24,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:53:24,645 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:24,645 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:24,645 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:24,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:24,646 INFO L82 PathProgramCache]: Analyzing trace with hash 2143606157, now seen corresponding path program 2 times [2019-12-07 11:53:24,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:53:24,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527086235] [2019-12-07 11:53:24,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:24,723 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 11:53:24,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527086235] [2019-12-07 11:53:24,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:24,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:53:24,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910449772] [2019-12-07 11:53:24,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:53:24,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:53:24,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:53:24,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:53:24,724 INFO L87 Difference]: Start difference. First operand 6848 states and 19717 transitions. Second operand 6 states. [2019-12-07 11:53:24,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:24,989 INFO L93 Difference]: Finished difference Result 7633 states and 21629 transitions. [2019-12-07 11:53:24,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:53:24,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 11:53:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:24,998 INFO L225 Difference]: With dead ends: 7633 [2019-12-07 11:53:24,998 INFO L226 Difference]: Without dead ends: 7633 [2019-12-07 11:53:24,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:53:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7633 states. [2019-12-07 11:53:25,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7633 to 7018. [2019-12-07 11:53:25,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7018 states. [2019-12-07 11:53:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7018 states to 7018 states and 20120 transitions. [2019-12-07 11:53:25,087 INFO L78 Accepts]: Start accepts. Automaton has 7018 states and 20120 transitions. Word has length 62 [2019-12-07 11:53:25,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:25,088 INFO L462 AbstractCegarLoop]: Abstraction has 7018 states and 20120 transitions. [2019-12-07 11:53:25,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:53:25,088 INFO L276 IsEmpty]: Start isEmpty. Operand 7018 states and 20120 transitions. [2019-12-07 11:53:25,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:53:25,097 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:25,097 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:25,098 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:25,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:25,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2085196129, now seen corresponding path program 3 times [2019-12-07 11:53:25,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:53:25,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799506522] [2019-12-07 11:53:25,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:25,177 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 11:53:25,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799506522] [2019-12-07 11:53:25,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:25,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:53:25,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448533630] [2019-12-07 11:53:25,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:53:25,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:53:25,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:53:25,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:53:25,178 INFO L87 Difference]: Start difference. First operand 7018 states and 20120 transitions. Second operand 6 states. [2019-12-07 11:53:25,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:25,481 INFO L93 Difference]: Finished difference Result 9767 states and 27842 transitions. [2019-12-07 11:53:25,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:53:25,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 11:53:25,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:25,491 INFO L225 Difference]: With dead ends: 9767 [2019-12-07 11:53:25,491 INFO L226 Difference]: Without dead ends: 9767 [2019-12-07 11:53:25,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:53:25,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2019-12-07 11:53:25,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 7518. [2019-12-07 11:53:25,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7518 states. [2019-12-07 11:53:25,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7518 states to 7518 states and 21628 transitions. [2019-12-07 11:53:25,593 INFO L78 Accepts]: Start accepts. Automaton has 7518 states and 21628 transitions. Word has length 62 [2019-12-07 11:53:25,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:25,593 INFO L462 AbstractCegarLoop]: Abstraction has 7518 states and 21628 transitions. [2019-12-07 11:53:25,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:53:25,594 INFO L276 IsEmpty]: Start isEmpty. Operand 7518 states and 21628 transitions. [2019-12-07 11:53:25,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:53:25,604 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:25,604 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:25,604 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:25,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:25,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1867726925, now seen corresponding path program 4 times [2019-12-07 11:53:25,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:53:25,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872151303] [2019-12-07 11:53:25,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:25,680 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 11:53:25,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872151303] [2019-12-07 11:53:25,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:25,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:53:25,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307068497] [2019-12-07 11:53:25,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:53:25,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:53:25,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:53:25,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:53:25,681 INFO L87 Difference]: Start difference. First operand 7518 states and 21628 transitions. Second operand 6 states. [2019-12-07 11:53:25,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:25,864 INFO L93 Difference]: Finished difference Result 9767 states and 27574 transitions. [2019-12-07 11:53:25,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:53:25,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 11:53:25,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:25,874 INFO L225 Difference]: With dead ends: 9767 [2019-12-07 11:53:25,874 INFO L226 Difference]: Without dead ends: 9767 [2019-12-07 11:53:25,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:53:25,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2019-12-07 11:53:25,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 8212. [2019-12-07 11:53:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8212 states. [2019-12-07 11:53:25,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8212 states to 8212 states and 23459 transitions. [2019-12-07 11:53:25,976 INFO L78 Accepts]: Start accepts. Automaton has 8212 states and 23459 transitions. Word has length 62 [2019-12-07 11:53:25,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:25,977 INFO L462 AbstractCegarLoop]: Abstraction has 8212 states and 23459 transitions. [2019-12-07 11:53:25,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:53:25,977 INFO L276 IsEmpty]: Start isEmpty. Operand 8212 states and 23459 transitions. [2019-12-07 11:53:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:53:25,987 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:25,988 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:25,988 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:25,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:25,988 INFO L82 PathProgramCache]: Analyzing trace with hash -390801364, now seen corresponding path program 1 times [2019-12-07 11:53:25,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:53:25,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056471984] [2019-12-07 11:53:25,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:26,072 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 11:53:26,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056471984] [2019-12-07 11:53:26,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:26,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:53:26,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299327552] [2019-12-07 11:53:26,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:53:26,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:53:26,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:53:26,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:53:26,073 INFO L87 Difference]: Start difference. First operand 8212 states and 23459 transitions. Second operand 5 states. [2019-12-07 11:53:26,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:26,121 INFO L93 Difference]: Finished difference Result 9053 states and 25363 transitions. [2019-12-07 11:53:26,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:53:26,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 11:53:26,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:26,127 INFO L225 Difference]: With dead ends: 9053 [2019-12-07 11:53:26,127 INFO L226 Difference]: Without dead ends: 4943 [2019-12-07 11:53:26,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:53:26,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4943 states. [2019-12-07 11:53:26,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4943 to 4943. [2019-12-07 11:53:26,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4943 states. [2019-12-07 11:53:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4943 states to 4943 states and 12410 transitions. [2019-12-07 11:53:26,174 INFO L78 Accepts]: Start accepts. Automaton has 4943 states and 12410 transitions. Word has length 63 [2019-12-07 11:53:26,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:26,174 INFO L462 AbstractCegarLoop]: Abstraction has 4943 states and 12410 transitions. [2019-12-07 11:53:26,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:53:26,175 INFO L276 IsEmpty]: Start isEmpty. Operand 4943 states and 12410 transitions. [2019-12-07 11:53:26,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:53:26,180 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:26,180 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:26,180 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:26,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:26,180 INFO L82 PathProgramCache]: Analyzing trace with hash 478203150, now seen corresponding path program 2 times [2019-12-07 11:53:26,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:53:26,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718836783] [2019-12-07 11:53:26,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:26,281 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 11:53:26,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718836783] [2019-12-07 11:53:26,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:26,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:53:26,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426612589] [2019-12-07 11:53:26,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:53:26,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:53:26,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:53:26,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:53:26,283 INFO L87 Difference]: Start difference. First operand 4943 states and 12410 transitions. Second operand 6 states. [2019-12-07 11:53:26,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:26,389 INFO L93 Difference]: Finished difference Result 8594 states and 22117 transitions. [2019-12-07 11:53:26,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:53:26,390 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-07 11:53:26,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:26,399 INFO L225 Difference]: With dead ends: 8594 [2019-12-07 11:53:26,399 INFO L226 Difference]: Without dead ends: 7295 [2019-12-07 11:53:26,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:53:26,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7295 states. [2019-12-07 11:53:26,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7295 to 6113. [2019-12-07 11:53:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6113 states. [2019-12-07 11:53:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6113 states to 6113 states and 15289 transitions. [2019-12-07 11:53:26,475 INFO L78 Accepts]: Start accepts. Automaton has 6113 states and 15289 transitions. Word has length 63 [2019-12-07 11:53:26,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:26,475 INFO L462 AbstractCegarLoop]: Abstraction has 6113 states and 15289 transitions. [2019-12-07 11:53:26,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:53:26,475 INFO L276 IsEmpty]: Start isEmpty. Operand 6113 states and 15289 transitions. [2019-12-07 11:53:26,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:53:26,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:26,484 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:26,484 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:26,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:26,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1580623076, now seen corresponding path program 3 times [2019-12-07 11:53:26,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:53:26,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327512443] [2019-12-07 11:53:26,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:26,563 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 11:53:26,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327512443] [2019-12-07 11:53:26,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:26,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:53:26,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136594948] [2019-12-07 11:53:26,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:53:26,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:53:26,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:53:26,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:53:26,565 INFO L87 Difference]: Start difference. First operand 6113 states and 15289 transitions. Second operand 4 states. [2019-12-07 11:53:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:26,611 INFO L93 Difference]: Finished difference Result 6581 states and 16344 transitions. [2019-12-07 11:53:26,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:53:26,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-07 11:53:26,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:26,616 INFO L225 Difference]: With dead ends: 6581 [2019-12-07 11:53:26,616 INFO L226 Difference]: Without dead ends: 4860 [2019-12-07 11:53:26,616 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 11:53:26,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4860 states. [2019-12-07 11:53:26,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4860 to 4442. [2019-12-07 11:53:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4442 states. [2019-12-07 11:53:26,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4442 states to 4442 states and 11169 transitions. [2019-12-07 11:53:26,666 INFO L78 Accepts]: Start accepts. Automaton has 4442 states and 11169 transitions. Word has length 63 [2019-12-07 11:53:26,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:26,666 INFO L462 AbstractCegarLoop]: Abstraction has 4442 states and 11169 transitions. [2019-12-07 11:53:26,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:53:26,666 INFO L276 IsEmpty]: Start isEmpty. Operand 4442 states and 11169 transitions. [2019-12-07 11:53:26,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:53:26,670 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:26,670 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:26,670 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:26,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:26,671 INFO L82 PathProgramCache]: Analyzing trace with hash 76538126, now seen corresponding path program 4 times [2019-12-07 11:53:26,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:53:26,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055868721] [2019-12-07 11:53:26,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:26,747 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 11:53:26,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055868721] [2019-12-07 11:53:26,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:26,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:53:26,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237032220] [2019-12-07 11:53:26,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:53:26,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:53:26,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:53:26,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:53:26,748 INFO L87 Difference]: Start difference. First operand 4442 states and 11169 transitions. Second operand 5 states. [2019-12-07 11:53:26,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:26,780 INFO L93 Difference]: Finished difference Result 4904 states and 12214 transitions. [2019-12-07 11:53:26,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:53:26,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 11:53:26,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:26,781 INFO L225 Difference]: With dead ends: 4904 [2019-12-07 11:53:26,781 INFO L226 Difference]: Without dead ends: 529 [2019-12-07 11:53:26,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:53:26,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-12-07 11:53:26,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2019-12-07 11:53:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-07 11:53:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1142 transitions. [2019-12-07 11:53:26,786 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1142 transitions. Word has length 63 [2019-12-07 11:53:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:26,786 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 1142 transitions. [2019-12-07 11:53:26,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:53:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1142 transitions. [2019-12-07 11:53:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:53:26,787 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:26,787 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:26,787 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:26,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:26,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1862642384, now seen corresponding path program 5 times [2019-12-07 11:53:26,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:53:26,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349027241] [2019-12-07 11:53:26,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:26,876 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 11:53:26,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349027241] [2019-12-07 11:53:26,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:26,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:53:26,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778864072] [2019-12-07 11:53:26,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:53:26,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:53:26,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:53:26,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:53:26,878 INFO L87 Difference]: Start difference. First operand 529 states and 1142 transitions. Second operand 8 states. [2019-12-07 11:53:27,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:27,064 INFO L93 Difference]: Finished difference Result 1082 states and 2311 transitions. [2019-12-07 11:53:27,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:53:27,064 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-07 11:53:27,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:27,065 INFO L225 Difference]: With dead ends: 1082 [2019-12-07 11:53:27,065 INFO L226 Difference]: Without dead ends: 759 [2019-12-07 11:53:27,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:53:27,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-12-07 11:53:27,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 613. [2019-12-07 11:53:27,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-12-07 11:53:27,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1288 transitions. [2019-12-07 11:53:27,073 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1288 transitions. Word has length 63 [2019-12-07 11:53:27,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:27,073 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 1288 transitions. [2019-12-07 11:53:27,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:53:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1288 transitions. [2019-12-07 11:53:27,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:53:27,074 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:27,074 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:27,074 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:27,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:27,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1992733266, now seen corresponding path program 6 times [2019-12-07 11:53:27,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:53:27,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737744340] [2019-12-07 11:53:27,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:53:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:53:27,166 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 11:53:27,166 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:53:27,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_169| 0 0))) (and (= v_~z$r_buff1_thd0~0_270 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t53~0.base_132|) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~__unbuffered_p1_EBX~0_131) (= v_~z$r_buff0_thd2~0_393 0) (= v_~z$w_buff1~0_325 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t53~0.base_132| 4) |v_#length_23|) (= v_~z$r_buff1_thd2~0_390 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= (store .cse0 |v_ULTIMATE.start_main_~#t53~0.base_132| 1) |v_#valid_167|) (= 0 v_~__unbuffered_p2_EAX~0_113) (= v_~x~0_15 0) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_54 0) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~main$tmp_guard1~0_91 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd3~0_325) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t53~0.base_132| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t53~0.base_132|) |v_ULTIMATE.start_main_~#t53~0.offset_73| 0)) |v_#memory_int_23|) (= 0 v_~weak$$choice0~0_184) (= v_~__unbuffered_p1_EAX~0_121 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_cnt~0_117 0) (= v_~a~0_20 0) (= 0 |v_#NULL.base_4|) (= v_~z$w_buff1_used~0_648 0) (= v_~z$r_buff0_thd1~0_76 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t53~0.base_132|)) (= v_~weak$$choice2~0_263 0) (= v_~z$w_buff0_used~0_1001 0) (= v_~z$read_delayed~0_7 0) (= v_~__unbuffered_p2_EBX~0_94 0) (= 0 |v_ULTIMATE.start_main_~#t53~0.offset_73|) (= |v_#NULL.offset_4| 0) (= 0 v_~z$flush_delayed~0_244) (= v_~z$w_buff0~0_523 0) (= 0 v_~z$mem_tmp~0_199) (= 0 v_~z$r_buff0_thd3~0_497) (= v_~z~0_324 0) (= v_~z$r_buff1_thd1~0_146 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_169|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_390, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t55~0.base=|v_ULTIMATE.start_main_~#t55~0.base_56|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_121, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_113, ULTIMATE.start_main_~#t55~0.offset=|v_ULTIMATE.start_main_~#t55~0.offset_34|, ~z$mem_tmp~0=v_~z$mem_tmp~0_199, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_94, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_45|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_648, ~z$flush_delayed~0=v_~z$flush_delayed~0_244, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_181|, ~weak$$choice0~0=v_~weak$$choice0~0_184, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_277|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_146, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_497, ULTIMATE.start_main_~#t53~0.base=|v_ULTIMATE.start_main_~#t53~0.base_132|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ~x~0=v_~x~0_15, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_325, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t54~0.base=|v_ULTIMATE.start_main_~#t54~0.base_94|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_270, ~y~0=v_~y~0_54, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_393, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1001, ~z$w_buff0~0=v_~z$w_buff0~0_523, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_325, ULTIMATE.start_main_~#t54~0.offset=|v_ULTIMATE.start_main_~#t54~0.offset_35|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_33|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_159|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_75|, #valid=|v_#valid_167|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_324, ULTIMATE.start_main_~#t53~0.offset=|v_ULTIMATE.start_main_~#t53~0.offset_73|, ~weak$$choice2~0=v_~weak$$choice2~0_263, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t55~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t55~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t53~0.base, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t54~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t54~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t53~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:53:27,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L845-1-->L847: Formula: (and (not (= |v_ULTIMATE.start_main_~#t54~0.base_10| 0)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t54~0.base_10| 1) |v_#valid_31|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t54~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t54~0.base_10|) |v_ULTIMATE.start_main_~#t54~0.offset_9| 1))) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t54~0.base_10|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t54~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t54~0.offset_9| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t54~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t54~0.offset=|v_ULTIMATE.start_main_~#t54~0.offset_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t54~0.base=|v_ULTIMATE.start_main_~#t54~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t54~0.offset, #length, ULTIMATE.start_main_~#t54~0.base] because there is no mapped edge [2019-12-07 11:53:27,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L847-1-->L849: Formula: (and (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t55~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t55~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t55~0.base_11|)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t55~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t55~0.base_11|) |v_ULTIMATE.start_main_~#t55~0.offset_9| 2))) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t55~0.base_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t55~0.base_11| 4) |v_#length_15|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t55~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t55~0.base=|v_ULTIMATE.start_main_~#t55~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_4|, #memory_int=|v_#memory_int_15|, #length=|v_#length_15|, ULTIMATE.start_main_~#t55~0.offset=|v_ULTIMATE.start_main_~#t55~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t55~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t55~0.offset] because there is no mapped edge [2019-12-07 11:53:27,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L807: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14)) (= v_~z$mem_tmp~0_15 v_~z~0_26) (= v_~weak$$choice2~0_39 v_~z$flush_delayed~0_19) (= v_~z$r_buff0_thd3~0_61 1) (= |v_P2Thread1of1ForFork0_#t~nondet27_12| v_~weak$$choice2~0_39) (= v_~z$r_buff1_thd1~0_7 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_18 v_~z$r_buff1_thd0~0_14) (= v_~z$r_buff0_thd2~0_52 v_~z$r_buff1_thd2~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet26_12| v_~weak$$choice0~0_12) (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff1_thd3~0_38)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_12|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~z~0=v_~z~0_26, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_12|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_38, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_31, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_11|, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_11|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52} AuxVars[] AssignedVars[~z$mem_tmp~0, ~weak$$choice0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, P2Thread1of1ForFork0_#t~nondet27, ~z$r_buff0_thd3~0, ~z$flush_delayed~0, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 11:53:27,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L807-2-->L807-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite28_Out1616711730| |P2Thread1of1ForFork0_#t~ite29_Out1616711730|)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In1616711730 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1616711730 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= |P2Thread1of1ForFork0_#t~ite28_Out1616711730| ~z$w_buff0~0_In1616711730)) (and .cse0 (or .cse2 .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out1616711730| ~z$w_buff1~0_In1616711730)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1616711730, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1616711730, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1616711730, ~z$w_buff1~0=~z$w_buff1~0_In1616711730} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1616711730|, ~z$w_buff0~0=~z$w_buff0~0_In1616711730, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1616711730, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1616711730, ~z$w_buff1~0=~z$w_buff1~0_In1616711730, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1616711730|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 11:53:27,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L812-->L813: Formula: (and (= v_~z$r_buff0_thd3~0_204 v_~z$r_buff0_thd3~0_203) (not (= 0 (mod v_~weak$$choice2~0_108 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_204, ~weak$$choice2~0=v_~weak$$choice2~0_108} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_203, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_9|, ~weak$$choice2~0=v_~weak$$choice2~0_108} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 11:53:27,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-2144038904 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-2144038904| ~z$mem_tmp~0_In-2144038904)) (and .cse0 (= ~z~0_In-2144038904 |P2Thread1of1ForFork0_#t~ite48_Out-2144038904|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-2144038904, ~z$flush_delayed~0=~z$flush_delayed~0_In-2144038904, ~z~0=~z~0_In-2144038904} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-2144038904|, ~z$mem_tmp~0=~z$mem_tmp~0_In-2144038904, ~z$flush_delayed~0=~z$flush_delayed~0_In-2144038904, ~z~0=~z~0_In-2144038904} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 11:53:27,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_10 1) (= v_~a~0_15 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EBX~0_21 v_~y~0_43) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_10 v_~__unbuffered_p0_EAX~0_21) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_21, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43, ~x~0=v_~x~0_10, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 11:53:27,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1442908527 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1442908527 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1442908527|)) (and (= ~z$w_buff0_used~0_In1442908527 |P2Thread1of1ForFork0_#t~ite51_Out1442908527|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1442908527, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1442908527} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1442908527, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1442908527, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1442908527|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 11:53:27,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1826052415 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out1826052415| ~z~0_In1826052415)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out1826052415| ~z$mem_tmp~0_In1826052415) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1826052415, ~z$flush_delayed~0=~z$flush_delayed~0_In1826052415, ~z~0=~z~0_In1826052415} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1826052415, ~z$flush_delayed~0=~z$flush_delayed~0_In1826052415, ~z~0=~z~0_In1826052415, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1826052415|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:53:27,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 v_~z$flush_delayed~0_227) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= v_~z~0_219 |v_P1Thread1of1ForFork2_#t~ite25_86|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_86|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110, ~z$flush_delayed~0=v_~z$flush_delayed~0_227, ~z~0=v_~z~0_219, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_85|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:53:27,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In88863127 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In88863127 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In88863127 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In88863127 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In88863127 |P2Thread1of1ForFork0_#t~ite52_Out88863127|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork0_#t~ite52_Out88863127| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In88863127, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In88863127, ~z$w_buff1_used~0=~z$w_buff1_used~0_In88863127, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In88863127} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In88863127, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In88863127, ~z$w_buff1_used~0=~z$w_buff1_used~0_In88863127, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out88863127|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In88863127} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 11:53:27,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L825-->L826: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1704504673 256))) (.cse2 (= ~z$r_buff0_thd3~0_Out1704504673 ~z$r_buff0_thd3~0_In1704504673)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1704504673 256)))) (or (and (= ~z$r_buff0_thd3~0_Out1704504673 0) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1704504673, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1704504673} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1704504673, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out1704504673, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out1704504673|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 11:53:27,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In2142950921 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In2142950921 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In2142950921 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In2142950921 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In2142950921 |P2Thread1of1ForFork0_#t~ite54_Out2142950921|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out2142950921|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2142950921, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2142950921, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2142950921, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2142950921} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2142950921, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out2142950921|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2142950921, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2142950921, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2142950921} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 11:53:27,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L826-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_141 |v_P2Thread1of1ForFork0_#t~ite54_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_141, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 11:53:27,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L849-1-->L855: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_35) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:53:27,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L855-2-->L855-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In542985037 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite59_Out542985037| |ULTIMATE.start_main_#t~ite58_Out542985037|)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In542985037 256)))) (or (and (= ~z~0_In542985037 |ULTIMATE.start_main_#t~ite58_Out542985037|) .cse0 (or .cse1 .cse2)) (and (= ~z$w_buff1~0_In542985037 |ULTIMATE.start_main_#t~ite58_Out542985037|) (not .cse1) .cse0 (not .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In542985037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In542985037, ~z$w_buff1~0=~z$w_buff1~0_In542985037, ~z~0=~z~0_In542985037} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In542985037, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out542985037|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In542985037, ~z$w_buff1~0=~z$w_buff1~0_In542985037, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out542985037|, ~z~0=~z~0_In542985037} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 11:53:27,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1496984209 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1496984209 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out1496984209| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In1496984209 |ULTIMATE.start_main_#t~ite60_Out1496984209|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1496984209, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1496984209} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1496984209|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1496984209, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1496984209} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 11:53:27,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L857-->L857-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1544598265 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1544598265 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1544598265 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1544598265 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite61_Out-1544598265| ~z$w_buff1_used~0_In-1544598265)) (and (= |ULTIMATE.start_main_#t~ite61_Out-1544598265| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1544598265, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1544598265, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1544598265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1544598265} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1544598265, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1544598265|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1544598265, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1544598265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1544598265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 11:53:27,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1556862938 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1556862938 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1556862938 |ULTIMATE.start_main_#t~ite62_Out-1556862938|)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out-1556862938|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1556862938, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1556862938} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1556862938|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1556862938, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1556862938} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 11:53:27,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L859-->L859-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-1393276984 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1393276984 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1393276984 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1393276984 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-1393276984|)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite63_Out-1393276984| ~z$r_buff1_thd0~0_In-1393276984) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1393276984, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1393276984, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1393276984, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1393276984} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1393276984|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1393276984, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1393276984, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1393276984, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1393276984} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 11:53:27,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_203 |v_ULTIMATE.start_main_#t~ite63_52|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_24 256)) (= v_~main$tmp_guard1~0_24 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_28 0) (= 1 v_~__unbuffered_p0_EAX~0_28) (= 1 v_~__unbuffered_p1_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_49 0) (= v_~__unbuffered_p2_EBX~0_27 0) (= 1 v_~__unbuffered_p2_EAX~0_34))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_51|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:53:27,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:53:27 BasicIcfg [2019-12-07 11:53:27,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:53:27,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:53:27,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:53:27,262 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:53:27,263 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:53:00" (3/4) ... [2019-12-07 11:53:27,264 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:53:27,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_169| 0 0))) (and (= v_~z$r_buff1_thd0~0_270 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t53~0.base_132|) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~__unbuffered_p1_EBX~0_131) (= v_~z$r_buff0_thd2~0_393 0) (= v_~z$w_buff1~0_325 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t53~0.base_132| 4) |v_#length_23|) (= v_~z$r_buff1_thd2~0_390 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= (store .cse0 |v_ULTIMATE.start_main_~#t53~0.base_132| 1) |v_#valid_167|) (= 0 v_~__unbuffered_p2_EAX~0_113) (= v_~x~0_15 0) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_54 0) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~main$tmp_guard1~0_91 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd3~0_325) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t53~0.base_132| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t53~0.base_132|) |v_ULTIMATE.start_main_~#t53~0.offset_73| 0)) |v_#memory_int_23|) (= 0 v_~weak$$choice0~0_184) (= v_~__unbuffered_p1_EAX~0_121 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_cnt~0_117 0) (= v_~a~0_20 0) (= 0 |v_#NULL.base_4|) (= v_~z$w_buff1_used~0_648 0) (= v_~z$r_buff0_thd1~0_76 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t53~0.base_132|)) (= v_~weak$$choice2~0_263 0) (= v_~z$w_buff0_used~0_1001 0) (= v_~z$read_delayed~0_7 0) (= v_~__unbuffered_p2_EBX~0_94 0) (= 0 |v_ULTIMATE.start_main_~#t53~0.offset_73|) (= |v_#NULL.offset_4| 0) (= 0 v_~z$flush_delayed~0_244) (= v_~z$w_buff0~0_523 0) (= 0 v_~z$mem_tmp~0_199) (= 0 v_~z$r_buff0_thd3~0_497) (= v_~z~0_324 0) (= v_~z$r_buff1_thd1~0_146 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_169|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_390, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t55~0.base=|v_ULTIMATE.start_main_~#t55~0.base_56|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_121, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_113, ULTIMATE.start_main_~#t55~0.offset=|v_ULTIMATE.start_main_~#t55~0.offset_34|, ~z$mem_tmp~0=v_~z$mem_tmp~0_199, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_94, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_45|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_648, ~z$flush_delayed~0=v_~z$flush_delayed~0_244, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_181|, ~weak$$choice0~0=v_~weak$$choice0~0_184, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_277|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_146, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_497, ULTIMATE.start_main_~#t53~0.base=|v_ULTIMATE.start_main_~#t53~0.base_132|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ~x~0=v_~x~0_15, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_325, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t54~0.base=|v_ULTIMATE.start_main_~#t54~0.base_94|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_270, ~y~0=v_~y~0_54, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_393, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1001, ~z$w_buff0~0=v_~z$w_buff0~0_523, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_325, ULTIMATE.start_main_~#t54~0.offset=|v_ULTIMATE.start_main_~#t54~0.offset_35|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_33|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_159|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_75|, #valid=|v_#valid_167|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_324, ULTIMATE.start_main_~#t53~0.offset=|v_ULTIMATE.start_main_~#t53~0.offset_73|, ~weak$$choice2~0=v_~weak$$choice2~0_263, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t55~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t55~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t53~0.base, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t54~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t54~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t53~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:53:27,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L845-1-->L847: Formula: (and (not (= |v_ULTIMATE.start_main_~#t54~0.base_10| 0)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t54~0.base_10| 1) |v_#valid_31|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t54~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t54~0.base_10|) |v_ULTIMATE.start_main_~#t54~0.offset_9| 1))) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t54~0.base_10|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t54~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t54~0.offset_9| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t54~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t54~0.offset=|v_ULTIMATE.start_main_~#t54~0.offset_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t54~0.base=|v_ULTIMATE.start_main_~#t54~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t54~0.offset, #length, ULTIMATE.start_main_~#t54~0.base] because there is no mapped edge [2019-12-07 11:53:27,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L847-1-->L849: Formula: (and (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t55~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t55~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t55~0.base_11|)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t55~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t55~0.base_11|) |v_ULTIMATE.start_main_~#t55~0.offset_9| 2))) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t55~0.base_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t55~0.base_11| 4) |v_#length_15|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t55~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t55~0.base=|v_ULTIMATE.start_main_~#t55~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_4|, #memory_int=|v_#memory_int_15|, #length=|v_#length_15|, ULTIMATE.start_main_~#t55~0.offset=|v_ULTIMATE.start_main_~#t55~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t55~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t55~0.offset] because there is no mapped edge [2019-12-07 11:53:27,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L807: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14)) (= v_~z$mem_tmp~0_15 v_~z~0_26) (= v_~weak$$choice2~0_39 v_~z$flush_delayed~0_19) (= v_~z$r_buff0_thd3~0_61 1) (= |v_P2Thread1of1ForFork0_#t~nondet27_12| v_~weak$$choice2~0_39) (= v_~z$r_buff1_thd1~0_7 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_18 v_~z$r_buff1_thd0~0_14) (= v_~z$r_buff0_thd2~0_52 v_~z$r_buff1_thd2~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet26_12| v_~weak$$choice0~0_12) (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff1_thd3~0_38)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_12|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~z~0=v_~z~0_26, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_12|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_38, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_31, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_11|, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_11|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52} AuxVars[] AssignedVars[~z$mem_tmp~0, ~weak$$choice0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, P2Thread1of1ForFork0_#t~nondet27, ~z$r_buff0_thd3~0, ~z$flush_delayed~0, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 11:53:27,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L807-2-->L807-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite28_Out1616711730| |P2Thread1of1ForFork0_#t~ite29_Out1616711730|)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In1616711730 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1616711730 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= |P2Thread1of1ForFork0_#t~ite28_Out1616711730| ~z$w_buff0~0_In1616711730)) (and .cse0 (or .cse2 .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out1616711730| ~z$w_buff1~0_In1616711730)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1616711730, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1616711730, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1616711730, ~z$w_buff1~0=~z$w_buff1~0_In1616711730} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1616711730|, ~z$w_buff0~0=~z$w_buff0~0_In1616711730, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1616711730, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1616711730, ~z$w_buff1~0=~z$w_buff1~0_In1616711730, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1616711730|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 11:53:27,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L812-->L813: Formula: (and (= v_~z$r_buff0_thd3~0_204 v_~z$r_buff0_thd3~0_203) (not (= 0 (mod v_~weak$$choice2~0_108 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_204, ~weak$$choice2~0=v_~weak$$choice2~0_108} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_203, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_9|, ~weak$$choice2~0=v_~weak$$choice2~0_108} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 11:53:27,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-2144038904 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-2144038904| ~z$mem_tmp~0_In-2144038904)) (and .cse0 (= ~z~0_In-2144038904 |P2Thread1of1ForFork0_#t~ite48_Out-2144038904|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-2144038904, ~z$flush_delayed~0=~z$flush_delayed~0_In-2144038904, ~z~0=~z~0_In-2144038904} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-2144038904|, ~z$mem_tmp~0=~z$mem_tmp~0_In-2144038904, ~z$flush_delayed~0=~z$flush_delayed~0_In-2144038904, ~z~0=~z~0_In-2144038904} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 11:53:27,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_10 1) (= v_~a~0_15 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EBX~0_21 v_~y~0_43) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_10 v_~__unbuffered_p0_EAX~0_21) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_21, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43, ~x~0=v_~x~0_10, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 11:53:27,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1442908527 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1442908527 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1442908527|)) (and (= ~z$w_buff0_used~0_In1442908527 |P2Thread1of1ForFork0_#t~ite51_Out1442908527|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1442908527, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1442908527} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1442908527, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1442908527, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1442908527|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 11:53:27,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1826052415 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out1826052415| ~z~0_In1826052415)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out1826052415| ~z$mem_tmp~0_In1826052415) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1826052415, ~z$flush_delayed~0=~z$flush_delayed~0_In1826052415, ~z~0=~z~0_In1826052415} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1826052415, ~z$flush_delayed~0=~z$flush_delayed~0_In1826052415, ~z~0=~z~0_In1826052415, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1826052415|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:53:27,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 v_~z$flush_delayed~0_227) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= v_~z~0_219 |v_P1Thread1of1ForFork2_#t~ite25_86|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_86|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110, ~z$flush_delayed~0=v_~z$flush_delayed~0_227, ~z~0=v_~z~0_219, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_85|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:53:27,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In88863127 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In88863127 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In88863127 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In88863127 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In88863127 |P2Thread1of1ForFork0_#t~ite52_Out88863127|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork0_#t~ite52_Out88863127| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In88863127, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In88863127, ~z$w_buff1_used~0=~z$w_buff1_used~0_In88863127, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In88863127} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In88863127, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In88863127, ~z$w_buff1_used~0=~z$w_buff1_used~0_In88863127, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out88863127|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In88863127} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 11:53:27,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L825-->L826: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1704504673 256))) (.cse2 (= ~z$r_buff0_thd3~0_Out1704504673 ~z$r_buff0_thd3~0_In1704504673)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1704504673 256)))) (or (and (= ~z$r_buff0_thd3~0_Out1704504673 0) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1704504673, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1704504673} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1704504673, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out1704504673, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out1704504673|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 11:53:27,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In2142950921 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In2142950921 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In2142950921 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In2142950921 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In2142950921 |P2Thread1of1ForFork0_#t~ite54_Out2142950921|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out2142950921|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2142950921, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2142950921, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2142950921, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2142950921} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2142950921, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out2142950921|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2142950921, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2142950921, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2142950921} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 11:53:27,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L826-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_141 |v_P2Thread1of1ForFork0_#t~ite54_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_141, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 11:53:27,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L849-1-->L855: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_35) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:53:27,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L855-2-->L855-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In542985037 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite59_Out542985037| |ULTIMATE.start_main_#t~ite58_Out542985037|)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In542985037 256)))) (or (and (= ~z~0_In542985037 |ULTIMATE.start_main_#t~ite58_Out542985037|) .cse0 (or .cse1 .cse2)) (and (= ~z$w_buff1~0_In542985037 |ULTIMATE.start_main_#t~ite58_Out542985037|) (not .cse1) .cse0 (not .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In542985037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In542985037, ~z$w_buff1~0=~z$w_buff1~0_In542985037, ~z~0=~z~0_In542985037} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In542985037, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out542985037|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In542985037, ~z$w_buff1~0=~z$w_buff1~0_In542985037, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out542985037|, ~z~0=~z~0_In542985037} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 11:53:27,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1496984209 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1496984209 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out1496984209| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In1496984209 |ULTIMATE.start_main_#t~ite60_Out1496984209|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1496984209, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1496984209} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1496984209|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1496984209, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1496984209} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 11:53:27,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L857-->L857-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1544598265 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1544598265 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1544598265 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1544598265 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite61_Out-1544598265| ~z$w_buff1_used~0_In-1544598265)) (and (= |ULTIMATE.start_main_#t~ite61_Out-1544598265| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1544598265, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1544598265, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1544598265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1544598265} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1544598265, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1544598265|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1544598265, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1544598265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1544598265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 11:53:27,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1556862938 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1556862938 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1556862938 |ULTIMATE.start_main_#t~ite62_Out-1556862938|)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out-1556862938|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1556862938, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1556862938} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1556862938|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1556862938, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1556862938} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 11:53:27,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L859-->L859-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-1393276984 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1393276984 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1393276984 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1393276984 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-1393276984|)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite63_Out-1393276984| ~z$r_buff1_thd0~0_In-1393276984) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1393276984, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1393276984, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1393276984, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1393276984} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1393276984|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1393276984, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1393276984, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1393276984, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1393276984} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 11:53:27,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_203 |v_ULTIMATE.start_main_#t~ite63_52|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_24 256)) (= v_~main$tmp_guard1~0_24 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_28 0) (= 1 v_~__unbuffered_p0_EAX~0_28) (= 1 v_~__unbuffered_p1_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_49 0) (= v_~__unbuffered_p2_EBX~0_27 0) (= 1 v_~__unbuffered_p2_EAX~0_34))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_51|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:53:27,350 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_22d8e787-ecc2-43b6-8688-2231d0aa970b/bin/utaipan/witness.graphml [2019-12-07 11:53:27,350 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:53:27,352 INFO L168 Benchmark]: Toolchain (without parser) took 27664.98 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 3.0 GB). Free memory was 943.5 MB in the beginning and 1.6 GB in the end (delta: -661.8 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-12-07 11:53:27,352 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:53:27,352 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -119.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:53:27,353 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:53:27,353 INFO L168 Benchmark]: Boogie Preprocessor took 31.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:53:27,353 INFO L168 Benchmark]: RCFGBuilder took 454.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.5 MB in the end (delta: 62.2 MB). Peak memory consumption was 62.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:53:27,353 INFO L168 Benchmark]: TraceAbstraction took 26647.34 ms. Allocated memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 995.5 MB in the beginning and 1.6 GB in the end (delta: -653.6 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-12-07 11:53:27,354 INFO L168 Benchmark]: Witness Printer took 88.46 ms. Allocated memory is still 4.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:53:27,355 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 395.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -119.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 454.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.5 MB in the end (delta: 62.2 MB). Peak memory consumption was 62.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26647.34 ms. Allocated memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 995.5 MB in the beginning and 1.6 GB in the end (delta: -653.6 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 88.46 ms. Allocated memory is still 4.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 198 ProgramPointsBefore, 105 ProgramPointsAfterwards, 244 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 58 ConcurrentYvCompositions, 28 ChoiceCompositions, 9655 VarBasedMoverChecksPositive, 318 VarBasedMoverChecksNegative, 83 SemBasedMoverChecksPositive, 339 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 139722 CheckedPairsTotal, 132 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t53, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t54, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t55, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1 = z$w_buff0 [L792] 3 z$w_buff0 = 1 [L793] 3 z$w_buff1_used = z$w_buff0_used [L794] 3 z$w_buff0_used = (_Bool)1 [L807] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L808] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L809] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L810] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 3 z = z$flush_delayed ? z$mem_tmp : z [L816] 3 z$flush_delayed = (_Bool)0 [L819] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 y = 1 [L763] 2 __unbuffered_p1_EAX = y [L766] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 2 z$flush_delayed = weak$$choice2 [L769] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L823] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L770] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L771] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L772] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L773] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L774] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L776] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 189 locations, 2 error locations. Result: UNSAFE, OverallTime: 26.4s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3377 SDtfs, 3343 SDslu, 5746 SDs, 0 SdLazy, 2091 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 28 SyntacticMatches, 9 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104212occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 31307 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 785 NumberOfCodeBlocks, 785 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 704 ConstructedInterpolants, 0 QuantifiedInterpolants, 234335 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...