./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_dd1dc266-5cf2-4fa4-817f-0a6e7f4508da/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dd1dc266-5cf2-4fa4-817f-0a6e7f4508da/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dd1dc266-5cf2-4fa4-817f-0a6e7f4508da/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dd1dc266-5cf2-4fa4-817f-0a6e7f4508da/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_dd1dc266-5cf2-4fa4-817f-0a6e7f4508da/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dd1dc266-5cf2-4fa4-817f-0a6e7f4508da/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 cd0cdc5f7297a22308aa354a86d663540671ba84 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:19:31,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:19:31,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:19:31,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:19:31,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:19:31,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:19:31,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:19:31,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:19:31,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:19:31,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:19:31,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:19:31,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:19:31,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:19:31,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:19:31,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:19:31,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:19:31,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:19:31,825 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:19:31,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:19:31,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:19:31,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:19:31,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:19:31,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:19:31,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:19:31,833 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:19:31,833 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:19:31,833 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:19:31,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:19:31,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:19:31,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:19:31,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:19:31,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:19:31,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:19:31,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:19:31,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:19:31,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:19:31,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:19:31,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:19:31,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:19:31,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:19:31,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:19:31,838 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dd1dc266-5cf2-4fa4-817f-0a6e7f4508da/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:19:31,849 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:19:31,849 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:19:31,849 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:19:31,850 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:19:31,850 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:19:31,850 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:19:31,850 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:19:31,850 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:19:31,850 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:19:31,850 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:19:31,851 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:19:31,851 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:19:31,851 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:19:31,851 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:19:31,851 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:19:31,851 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:19:31,852 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:19:31,852 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:19:31,852 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:19:31,852 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:19:31,852 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:19:31,852 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:19:31,852 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:19:31,852 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:19:31,852 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:19:31,853 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:19:31,853 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:19:31,853 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:19:31,853 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:19:31,853 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:19:31,853 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:19:31,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:19:31,853 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:19:31,853 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:19:31,854 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:19:31,854 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:19:31,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:19:31,854 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:19:31,854 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:19:31,854 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:19:31,854 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_dd1dc266-5cf2-4fa4-817f-0a6e7f4508da/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 -> cd0cdc5f7297a22308aa354a86d663540671ba84 [2019-12-07 20:19:31,953 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:19:31,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:19:31,963 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:19:31,964 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:19:31,964 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:19:31,964 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dd1dc266-5cf2-4fa4-817f-0a6e7f4508da/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi008_power.oepc.i [2019-12-07 20:19:32,001 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dd1dc266-5cf2-4fa4-817f-0a6e7f4508da/bin/utaipan/data/443a1c79c/29d3dd74154841d89762f4994acacd8e/FLAG5ff53708f [2019-12-07 20:19:32,380 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:19:32,381 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dd1dc266-5cf2-4fa4-817f-0a6e7f4508da/sv-benchmarks/c/pthread-wmm/rfi008_power.oepc.i [2019-12-07 20:19:32,391 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dd1dc266-5cf2-4fa4-817f-0a6e7f4508da/bin/utaipan/data/443a1c79c/29d3dd74154841d89762f4994acacd8e/FLAG5ff53708f [2019-12-07 20:19:32,400 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dd1dc266-5cf2-4fa4-817f-0a6e7f4508da/bin/utaipan/data/443a1c79c/29d3dd74154841d89762f4994acacd8e [2019-12-07 20:19:32,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:19:32,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:19:32,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:19:32,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:19:32,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:19:32,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:19:32" (1/1) ... [2019-12-07 20:19:32,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78735eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:32, skipping insertion in model container [2019-12-07 20:19:32,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:19:32" (1/1) ... [2019-12-07 20:19:32,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:19:32,442 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:19:32,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:19:32,706 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:19:32,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:19:32,800 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:19:32,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:32 WrapperNode [2019-12-07 20:19:32,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:19:32,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:19:32,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:19:32,802 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:19:32,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:32" (1/1) ... [2019-12-07 20:19:32,821 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:32" (1/1) ... [2019-12-07 20:19:32,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:19:32,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:19:32,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:19:32,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:19:32,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:32" (1/1) ... [2019-12-07 20:19:32,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:32" (1/1) ... [2019-12-07 20:19:32,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:32" (1/1) ... [2019-12-07 20:19:32,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:32" (1/1) ... [2019-12-07 20:19:32,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:32" (1/1) ... [2019-12-07 20:19:32,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:32" (1/1) ... [2019-12-07 20:19:32,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:32" (1/1) ... [2019-12-07 20:19:32,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:19:32,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:19:32,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:19:32,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:19:32,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dd1dc266-5cf2-4fa4-817f-0a6e7f4508da/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:19:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:19:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 20:19:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:19:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:19:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 20:19:32,918 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 20:19:32,918 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 20:19:32,918 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 20:19:32,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 20:19:32,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:19:32,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:19:32,920 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 20:19:33,326 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:19:33,326 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 20:19:33,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:19:33 BoogieIcfgContainer [2019-12-07 20:19:33,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:19:33,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:19:33,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:19:33,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:19:33,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:19:32" (1/3) ... [2019-12-07 20:19:33,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358dd5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:19:33, skipping insertion in model container [2019-12-07 20:19:33,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:32" (2/3) ... [2019-12-07 20:19:33,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358dd5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:19:33, skipping insertion in model container [2019-12-07 20:19:33,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:19:33" (3/3) ... [2019-12-07 20:19:33,332 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_power.oepc.i [2019-12-07 20:19:33,338 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 20:19:33,338 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:19:33,343 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 20:19:33,343 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 20:19:33,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,371 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,371 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,371 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,372 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,372 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,386 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,386 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:33,407 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 20:19:33,419 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:19:33,419 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:19:33,419 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:19:33,420 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:19:33,420 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:19:33,420 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:19:33,420 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:19:33,420 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:19:33,430 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 246 transitions [2019-12-07 20:19:33,431 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-07 20:19:33,495 INFO L134 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-07 20:19:33,495 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:19:33,507 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1046 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 20:19:33,530 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-07 20:19:33,569 INFO L134 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-07 20:19:33,569 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:19:33,578 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1046 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 20:19:33,603 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 27428 [2019-12-07 20:19:33,604 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 20:19:36,824 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 20:19:37,005 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 20:19:37,099 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146813 [2019-12-07 20:19:37,099 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-07 20:19:37,101 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 136 transitions [2019-12-07 20:19:38,659 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 29658 states. [2019-12-07 20:19:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand 29658 states. [2019-12-07 20:19:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 20:19:38,664 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:38,664 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 20:19:38,664 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:38,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:38,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1084682, now seen corresponding path program 1 times [2019-12-07 20:19:38,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:38,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244728448] [2019-12-07 20:19:38,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:38,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:38,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244728448] [2019-12-07 20:19:38,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:38,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:19:38,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865221544] [2019-12-07 20:19:38,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:19:38,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:38,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:19:38,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:38,818 INFO L87 Difference]: Start difference. First operand 29658 states. Second operand 3 states. [2019-12-07 20:19:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:39,123 INFO L93 Difference]: Finished difference Result 29506 states and 103746 transitions. [2019-12-07 20:19:39,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:19:39,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 20:19:39,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:39,289 INFO L225 Difference]: With dead ends: 29506 [2019-12-07 20:19:39,289 INFO L226 Difference]: Without dead ends: 27490 [2019-12-07 20:19:39,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:39,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27490 states. [2019-12-07 20:19:40,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27490 to 27490. [2019-12-07 20:19:40,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27490 states. [2019-12-07 20:19:40,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27490 states to 27490 states and 96576 transitions. [2019-12-07 20:19:40,305 INFO L78 Accepts]: Start accepts. Automaton has 27490 states and 96576 transitions. Word has length 3 [2019-12-07 20:19:40,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:40,306 INFO L462 AbstractCegarLoop]: Abstraction has 27490 states and 96576 transitions. [2019-12-07 20:19:40,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:19:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 27490 states and 96576 transitions. [2019-12-07 20:19:40,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:19:40,309 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:40,309 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:40,309 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:40,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:40,309 INFO L82 PathProgramCache]: Analyzing trace with hash -272589760, now seen corresponding path program 1 times [2019-12-07 20:19:40,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:40,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583103331] [2019-12-07 20:19:40,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:40,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:40,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583103331] [2019-12-07 20:19:40,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:40,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:19:40,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819818170] [2019-12-07 20:19:40,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:19:40,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:40,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:19:40,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:19:40,380 INFO L87 Difference]: Start difference. First operand 27490 states and 96576 transitions. Second operand 4 states. [2019-12-07 20:19:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:40,805 INFO L93 Difference]: Finished difference Result 43940 states and 147802 transitions. [2019-12-07 20:19:40,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:19:40,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 20:19:40,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:40,992 INFO L225 Difference]: With dead ends: 43940 [2019-12-07 20:19:40,992 INFO L226 Difference]: Without dead ends: 43933 [2019-12-07 20:19:40,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:19:41,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43933 states. [2019-12-07 20:19:42,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43933 to 42445. [2019-12-07 20:19:42,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42445 states. [2019-12-07 20:19:42,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42445 states to 42445 states and 143845 transitions. [2019-12-07 20:19:42,135 INFO L78 Accepts]: Start accepts. Automaton has 42445 states and 143845 transitions. Word has length 11 [2019-12-07 20:19:42,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:42,135 INFO L462 AbstractCegarLoop]: Abstraction has 42445 states and 143845 transitions. [2019-12-07 20:19:42,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:19:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand 42445 states and 143845 transitions. [2019-12-07 20:19:42,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 20:19:42,141 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:42,141 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:42,141 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:42,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:42,142 INFO L82 PathProgramCache]: Analyzing trace with hash 295368792, now seen corresponding path program 1 times [2019-12-07 20:19:42,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:42,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032368386] [2019-12-07 20:19:42,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:42,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:42,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032368386] [2019-12-07 20:19:42,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:42,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:19:42,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426505711] [2019-12-07 20:19:42,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:19:42,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:42,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:19:42,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:19:42,185 INFO L87 Difference]: Start difference. First operand 42445 states and 143845 transitions. Second operand 4 states. [2019-12-07 20:19:42,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:42,495 INFO L93 Difference]: Finished difference Result 54065 states and 181150 transitions. [2019-12-07 20:19:42,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:19:42,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 20:19:42,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:42,594 INFO L225 Difference]: With dead ends: 54065 [2019-12-07 20:19:42,594 INFO L226 Difference]: Without dead ends: 54065 [2019-12-07 20:19:42,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:19:43,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54065 states. [2019-12-07 20:19:43,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54065 to 48429. [2019-12-07 20:19:43,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48429 states. [2019-12-07 20:19:43,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48429 states to 48429 states and 163514 transitions. [2019-12-07 20:19:43,749 INFO L78 Accepts]: Start accepts. Automaton has 48429 states and 163514 transitions. Word has length 14 [2019-12-07 20:19:43,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:43,749 INFO L462 AbstractCegarLoop]: Abstraction has 48429 states and 163514 transitions. [2019-12-07 20:19:43,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:19:43,750 INFO L276 IsEmpty]: Start isEmpty. Operand 48429 states and 163514 transitions. [2019-12-07 20:19:43,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:19:43,752 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:43,752 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:43,752 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:43,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:43,753 INFO L82 PathProgramCache]: Analyzing trace with hash 566526596, now seen corresponding path program 1 times [2019-12-07 20:19:43,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:43,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23733966] [2019-12-07 20:19:43,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:43,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23733966] [2019-12-07 20:19:43,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:43,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:19:43,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731151754] [2019-12-07 20:19:43,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:19:43,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:43,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:19:43,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:43,786 INFO L87 Difference]: Start difference. First operand 48429 states and 163514 transitions. Second operand 3 states. [2019-12-07 20:19:44,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:44,200 INFO L93 Difference]: Finished difference Result 84362 states and 273188 transitions. [2019-12-07 20:19:44,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:19:44,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 20:19:44,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:44,321 INFO L225 Difference]: With dead ends: 84362 [2019-12-07 20:19:44,321 INFO L226 Difference]: Without dead ends: 84362 [2019-12-07 20:19:44,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:44,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84362 states. [2019-12-07 20:19:45,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84362 to 74579. [2019-12-07 20:19:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74579 states. [2019-12-07 20:19:46,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74579 states to 74579 states and 244551 transitions. [2019-12-07 20:19:46,004 INFO L78 Accepts]: Start accepts. Automaton has 74579 states and 244551 transitions. Word has length 15 [2019-12-07 20:19:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:46,005 INFO L462 AbstractCegarLoop]: Abstraction has 74579 states and 244551 transitions. [2019-12-07 20:19:46,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:19:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand 74579 states and 244551 transitions. [2019-12-07 20:19:46,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 20:19:46,008 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:46,008 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:46,008 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:46,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:46,009 INFO L82 PathProgramCache]: Analyzing trace with hash 965979864, now seen corresponding path program 1 times [2019-12-07 20:19:46,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:46,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208628349] [2019-12-07 20:19:46,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:46,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208628349] [2019-12-07 20:19:46,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:46,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:19:46,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057662735] [2019-12-07 20:19:46,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:19:46,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:46,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:19:46,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:46,061 INFO L87 Difference]: Start difference. First operand 74579 states and 244551 transitions. Second operand 3 states. [2019-12-07 20:19:46,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:46,290 INFO L93 Difference]: Finished difference Result 74600 states and 244461 transitions. [2019-12-07 20:19:46,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:19:46,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 20:19:46,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:46,410 INFO L225 Difference]: With dead ends: 74600 [2019-12-07 20:19:46,410 INFO L226 Difference]: Without dead ends: 74600 [2019-12-07 20:19:46,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:47,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74600 states. [2019-12-07 20:19:47,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74600 to 74508. [2019-12-07 20:19:47,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74508 states. [2019-12-07 20:19:48,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74508 states to 74508 states and 244321 transitions. [2019-12-07 20:19:48,009 INFO L78 Accepts]: Start accepts. Automaton has 74508 states and 244321 transitions. Word has length 16 [2019-12-07 20:19:48,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:48,009 INFO L462 AbstractCegarLoop]: Abstraction has 74508 states and 244321 transitions. [2019-12-07 20:19:48,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:19:48,009 INFO L276 IsEmpty]: Start isEmpty. Operand 74508 states and 244321 transitions. [2019-12-07 20:19:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 20:19:48,013 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:48,013 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 20:19:48,013 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:48,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:48,013 INFO L82 PathProgramCache]: Analyzing trace with hash -119401417, now seen corresponding path program 1 times [2019-12-07 20:19:48,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:48,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085685368] [2019-12-07 20:19:48,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:48,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085685368] [2019-12-07 20:19:48,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:48,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:19:48,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147059770] [2019-12-07 20:19:48,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:19:48,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:48,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:19:48,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:19:48,061 INFO L87 Difference]: Start difference. First operand 74508 states and 244321 transitions. Second operand 4 states. [2019-12-07 20:19:48,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:48,278 INFO L93 Difference]: Finished difference Result 70111 states and 229603 transitions. [2019-12-07 20:19:48,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:19:48,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 20:19:48,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:48,388 INFO L225 Difference]: With dead ends: 70111 [2019-12-07 20:19:48,389 INFO L226 Difference]: Without dead ends: 70111 [2019-12-07 20:19:48,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:19:49,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70111 states. [2019-12-07 20:19:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70111 to 70111. [2019-12-07 20:19:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70111 states. [2019-12-07 20:19:50,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70111 states to 70111 states and 229603 transitions. [2019-12-07 20:19:50,741 INFO L78 Accepts]: Start accepts. Automaton has 70111 states and 229603 transitions. Word has length 17 [2019-12-07 20:19:50,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:50,741 INFO L462 AbstractCegarLoop]: Abstraction has 70111 states and 229603 transitions. [2019-12-07 20:19:50,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:19:50,741 INFO L276 IsEmpty]: Start isEmpty. Operand 70111 states and 229603 transitions. [2019-12-07 20:19:50,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 20:19:50,746 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:50,746 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 20:19:50,746 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:50,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:50,746 INFO L82 PathProgramCache]: Analyzing trace with hash -759251224, now seen corresponding path program 1 times [2019-12-07 20:19:50,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:50,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219336881] [2019-12-07 20:19:50,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:50,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219336881] [2019-12-07 20:19:50,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:50,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:19:50,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132046842] [2019-12-07 20:19:50,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:19:50,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:50,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:19:50,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:19:50,776 INFO L87 Difference]: Start difference. First operand 70111 states and 229603 transitions. Second operand 4 states. [2019-12-07 20:19:51,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:51,212 INFO L93 Difference]: Finished difference Result 85638 states and 277753 transitions. [2019-12-07 20:19:51,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:19:51,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 20:19:51,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:51,347 INFO L225 Difference]: With dead ends: 85638 [2019-12-07 20:19:51,347 INFO L226 Difference]: Without dead ends: 85638 [2019-12-07 20:19:51,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:19:52,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85638 states. [2019-12-07 20:19:52,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85638 to 70760. [2019-12-07 20:19:52,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70760 states. [2019-12-07 20:19:52,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70760 states to 70760 states and 231729 transitions. [2019-12-07 20:19:52,999 INFO L78 Accepts]: Start accepts. Automaton has 70760 states and 231729 transitions. Word has length 17 [2019-12-07 20:19:52,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:52,999 INFO L462 AbstractCegarLoop]: Abstraction has 70760 states and 231729 transitions. [2019-12-07 20:19:53,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:19:53,000 INFO L276 IsEmpty]: Start isEmpty. Operand 70760 states and 231729 transitions. [2019-12-07 20:19:53,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:19:53,007 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:53,007 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:53,007 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:53,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:53,008 INFO L82 PathProgramCache]: Analyzing trace with hash 2046192734, now seen corresponding path program 1 times [2019-12-07 20:19:53,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:53,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156265934] [2019-12-07 20:19:53,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:53,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:53,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156265934] [2019-12-07 20:19:53,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:53,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:19:53,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874289446] [2019-12-07 20:19:53,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:19:53,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:53,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:19:53,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:53,032 INFO L87 Difference]: Start difference. First operand 70760 states and 231729 transitions. Second operand 3 states. [2019-12-07 20:19:53,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:53,050 INFO L93 Difference]: Finished difference Result 6599 states and 15392 transitions. [2019-12-07 20:19:53,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:19:53,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 20:19:53,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:53,055 INFO L225 Difference]: With dead ends: 6599 [2019-12-07 20:19:53,055 INFO L226 Difference]: Without dead ends: 6599 [2019-12-07 20:19:53,055 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 20:19:53,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6599 states. [2019-12-07 20:19:53,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6599 to 6523. [2019-12-07 20:19:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6523 states. [2019-12-07 20:19:53,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6523 states to 6523 states and 15240 transitions. [2019-12-07 20:19:53,118 INFO L78 Accepts]: Start accepts. Automaton has 6523 states and 15240 transitions. Word has length 20 [2019-12-07 20:19:53,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:53,118 INFO L462 AbstractCegarLoop]: Abstraction has 6523 states and 15240 transitions. [2019-12-07 20:19:53,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:19:53,118 INFO L276 IsEmpty]: Start isEmpty. Operand 6523 states and 15240 transitions. [2019-12-07 20:19:53,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 20:19:53,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:53,121 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] [2019-12-07 20:19:53,121 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:53,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1258171186, now seen corresponding path program 1 times [2019-12-07 20:19:53,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:53,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030931947] [2019-12-07 20:19:53,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:53,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:53,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030931947] [2019-12-07 20:19:53,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:53,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:19:53,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350804753] [2019-12-07 20:19:53,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:19:53,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:53,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:19:53,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:19:53,160 INFO L87 Difference]: Start difference. First operand 6523 states and 15240 transitions. Second operand 5 states. [2019-12-07 20:19:53,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:53,431 INFO L93 Difference]: Finished difference Result 8820 states and 20125 transitions. [2019-12-07 20:19:53,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:19:53,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 20:19:53,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:53,438 INFO L225 Difference]: With dead ends: 8820 [2019-12-07 20:19:53,438 INFO L226 Difference]: Without dead ends: 8820 [2019-12-07 20:19:53,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:19:53,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8820 states. [2019-12-07 20:19:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8820 to 8383. [2019-12-07 20:19:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8383 states. [2019-12-07 20:19:53,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8383 states to 8383 states and 19259 transitions. [2019-12-07 20:19:53,517 INFO L78 Accepts]: Start accepts. Automaton has 8383 states and 19259 transitions. Word has length 27 [2019-12-07 20:19:53,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:53,517 INFO L462 AbstractCegarLoop]: Abstraction has 8383 states and 19259 transitions. [2019-12-07 20:19:53,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:19:53,517 INFO L276 IsEmpty]: Start isEmpty. Operand 8383 states and 19259 transitions. [2019-12-07 20:19:53,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 20:19:53,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:53,521 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:53,521 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:53,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:53,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1366134434, now seen corresponding path program 1 times [2019-12-07 20:19:53,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:53,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302507434] [2019-12-07 20:19:53,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:53,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302507434] [2019-12-07 20:19:53,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:53,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:19:53,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548880183] [2019-12-07 20:19:53,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:19:53,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:53,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:19:53,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:53,543 INFO L87 Difference]: Start difference. First operand 8383 states and 19259 transitions. Second operand 3 states. [2019-12-07 20:19:53,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:53,605 INFO L93 Difference]: Finished difference Result 9518 states and 20716 transitions. [2019-12-07 20:19:53,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:19:53,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 20:19:53,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:53,613 INFO L225 Difference]: With dead ends: 9518 [2019-12-07 20:19:53,613 INFO L226 Difference]: Without dead ends: 9518 [2019-12-07 20:19:53,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:53,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9518 states. [2019-12-07 20:19:53,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9518 to 8380. [2019-12-07 20:19:53,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8380 states. [2019-12-07 20:19:53,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8380 states to 8380 states and 18372 transitions. [2019-12-07 20:19:53,694 INFO L78 Accepts]: Start accepts. Automaton has 8380 states and 18372 transitions. Word has length 30 [2019-12-07 20:19:53,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:53,695 INFO L462 AbstractCegarLoop]: Abstraction has 8380 states and 18372 transitions. [2019-12-07 20:19:53,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:19:53,695 INFO L276 IsEmpty]: Start isEmpty. Operand 8380 states and 18372 transitions. [2019-12-07 20:19:53,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 20:19:53,699 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:53,699 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:53,699 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:53,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:53,699 INFO L82 PathProgramCache]: Analyzing trace with hash -736726388, now seen corresponding path program 1 times [2019-12-07 20:19:53,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:53,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178765687] [2019-12-07 20:19:53,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:53,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:53,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178765687] [2019-12-07 20:19:53,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:53,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:19:53,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540591734] [2019-12-07 20:19:53,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:19:53,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:53,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:19:53,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:19:53,736 INFO L87 Difference]: Start difference. First operand 8380 states and 18372 transitions. Second operand 5 states. [2019-12-07 20:19:53,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:53,980 INFO L93 Difference]: Finished difference Result 9477 states and 20541 transitions. [2019-12-07 20:19:53,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:19:53,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 20:19:53,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:53,986 INFO L225 Difference]: With dead ends: 9477 [2019-12-07 20:19:53,987 INFO L226 Difference]: Without dead ends: 9477 [2019-12-07 20:19:53,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:19:54,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9477 states. [2019-12-07 20:19:54,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9477 to 7498. [2019-12-07 20:19:54,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7498 states. [2019-12-07 20:19:54,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7498 states to 7498 states and 16585 transitions. [2019-12-07 20:19:54,058 INFO L78 Accepts]: Start accepts. Automaton has 7498 states and 16585 transitions. Word has length 33 [2019-12-07 20:19:54,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:54,059 INFO L462 AbstractCegarLoop]: Abstraction has 7498 states and 16585 transitions. [2019-12-07 20:19:54,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:19:54,059 INFO L276 IsEmpty]: Start isEmpty. Operand 7498 states and 16585 transitions. [2019-12-07 20:19:54,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 20:19:54,064 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:54,064 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:54,064 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:54,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:54,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1616999435, now seen corresponding path program 1 times [2019-12-07 20:19:54,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:54,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174702941] [2019-12-07 20:19:54,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:54,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174702941] [2019-12-07 20:19:54,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:54,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:19:54,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350204981] [2019-12-07 20:19:54,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:19:54,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:54,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:19:54,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:19:54,154 INFO L87 Difference]: Start difference. First operand 7498 states and 16585 transitions. Second operand 8 states. [2019-12-07 20:19:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:54,791 INFO L93 Difference]: Finished difference Result 10355 states and 22220 transitions. [2019-12-07 20:19:54,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 20:19:54,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-12-07 20:19:54,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:54,799 INFO L225 Difference]: With dead ends: 10355 [2019-12-07 20:19:54,799 INFO L226 Difference]: Without dead ends: 10354 [2019-12-07 20:19:54,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-07 20:19:54,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10354 states. [2019-12-07 20:19:54,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10354 to 8902. [2019-12-07 20:19:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8902 states. [2019-12-07 20:19:54,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8902 states to 8902 states and 19410 transitions. [2019-12-07 20:19:54,960 INFO L78 Accepts]: Start accepts. Automaton has 8902 states and 19410 transitions. Word has length 39 [2019-12-07 20:19:54,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:54,960 INFO L462 AbstractCegarLoop]: Abstraction has 8902 states and 19410 transitions. [2019-12-07 20:19:54,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:19:54,960 INFO L276 IsEmpty]: Start isEmpty. Operand 8902 states and 19410 transitions. [2019-12-07 20:19:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 20:19:54,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:54,966 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] [2019-12-07 20:19:54,966 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:54,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:54,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1234492719, now seen corresponding path program 1 times [2019-12-07 20:19:54,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:54,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668549385] [2019-12-07 20:19:54,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:55,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:55,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668549385] [2019-12-07 20:19:55,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:55,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:19:55,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120663994] [2019-12-07 20:19:55,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:19:55,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:55,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:19:55,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:19:55,014 INFO L87 Difference]: Start difference. First operand 8902 states and 19410 transitions. Second operand 5 states. [2019-12-07 20:19:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:55,321 INFO L93 Difference]: Finished difference Result 10298 states and 22244 transitions. [2019-12-07 20:19:55,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:19:55,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 20:19:55,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:55,328 INFO L225 Difference]: With dead ends: 10298 [2019-12-07 20:19:55,328 INFO L226 Difference]: Without dead ends: 10298 [2019-12-07 20:19:55,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:19:55,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10298 states. [2019-12-07 20:19:55,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10298 to 9892. [2019-12-07 20:19:55,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9892 states. [2019-12-07 20:19:55,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9892 states to 9892 states and 21450 transitions. [2019-12-07 20:19:55,416 INFO L78 Accepts]: Start accepts. Automaton has 9892 states and 21450 transitions. Word has length 41 [2019-12-07 20:19:55,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:55,417 INFO L462 AbstractCegarLoop]: Abstraction has 9892 states and 21450 transitions. [2019-12-07 20:19:55,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:19:55,417 INFO L276 IsEmpty]: Start isEmpty. Operand 9892 states and 21450 transitions. [2019-12-07 20:19:55,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 20:19:55,424 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:55,424 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:55,424 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:55,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:55,424 INFO L82 PathProgramCache]: Analyzing trace with hash 27659275, now seen corresponding path program 1 times [2019-12-07 20:19:55,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:55,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124284160] [2019-12-07 20:19:55,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:55,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124284160] [2019-12-07 20:19:55,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:55,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:19:55,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135138203] [2019-12-07 20:19:55,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:19:55,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:55,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:19:55,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:19:55,476 INFO L87 Difference]: Start difference. First operand 9892 states and 21450 transitions. Second operand 4 states. [2019-12-07 20:19:55,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:55,639 INFO L93 Difference]: Finished difference Result 10884 states and 23439 transitions. [2019-12-07 20:19:55,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:19:55,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 20:19:55,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:55,646 INFO L225 Difference]: With dead ends: 10884 [2019-12-07 20:19:55,647 INFO L226 Difference]: Without dead ends: 10884 [2019-12-07 20:19:55,647 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 20:19:55,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10884 states. [2019-12-07 20:19:55,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10884 to 10545. [2019-12-07 20:19:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10545 states. [2019-12-07 20:19:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10545 states to 10545 states and 22730 transitions. [2019-12-07 20:19:55,743 INFO L78 Accepts]: Start accepts. Automaton has 10545 states and 22730 transitions. Word has length 42 [2019-12-07 20:19:55,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:55,743 INFO L462 AbstractCegarLoop]: Abstraction has 10545 states and 22730 transitions. [2019-12-07 20:19:55,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:19:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 10545 states and 22730 transitions. [2019-12-07 20:19:55,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 20:19:55,751 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:55,751 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:55,751 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:55,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:55,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2095012546, now seen corresponding path program 1 times [2019-12-07 20:19:55,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:55,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699763702] [2019-12-07 20:19:55,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:55,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:55,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699763702] [2019-12-07 20:19:55,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:55,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:19:55,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408493111] [2019-12-07 20:19:55,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:19:55,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:55,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:19:55,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:19:55,907 INFO L87 Difference]: Start difference. First operand 10545 states and 22730 transitions. Second operand 9 states. [2019-12-07 20:19:56,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:56,037 INFO L93 Difference]: Finished difference Result 10627 states and 22892 transitions. [2019-12-07 20:19:56,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:19:56,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2019-12-07 20:19:56,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:56,048 INFO L225 Difference]: With dead ends: 10627 [2019-12-07 20:19:56,048 INFO L226 Difference]: Without dead ends: 10627 [2019-12-07 20:19:56,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:19:56,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10627 states. [2019-12-07 20:19:56,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10627 to 10627. [2019-12-07 20:19:56,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10627 states. [2019-12-07 20:19:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10627 states to 10627 states and 22892 transitions. [2019-12-07 20:19:56,163 INFO L78 Accepts]: Start accepts. Automaton has 10627 states and 22892 transitions. Word has length 43 [2019-12-07 20:19:56,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:56,164 INFO L462 AbstractCegarLoop]: Abstraction has 10627 states and 22892 transitions. [2019-12-07 20:19:56,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:19:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand 10627 states and 22892 transitions. [2019-12-07 20:19:56,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 20:19:56,172 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:56,172 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] [2019-12-07 20:19:56,172 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:56,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:56,173 INFO L82 PathProgramCache]: Analyzing trace with hash 520873357, now seen corresponding path program 1 times [2019-12-07 20:19:56,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:56,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10588206] [2019-12-07 20:19:56,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:56,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10588206] [2019-12-07 20:19:56,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:56,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:19:56,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990143436] [2019-12-07 20:19:56,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:19:56,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:56,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:19:56,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:19:56,207 INFO L87 Difference]: Start difference. First operand 10627 states and 22892 transitions. Second operand 4 states. [2019-12-07 20:19:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:56,228 INFO L93 Difference]: Finished difference Result 7434 states and 15788 transitions. [2019-12-07 20:19:56,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:19:56,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-07 20:19:56,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:56,233 INFO L225 Difference]: With dead ends: 7434 [2019-12-07 20:19:56,233 INFO L226 Difference]: Without dead ends: 7434 [2019-12-07 20:19:56,233 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 20:19:56,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7434 states. [2019-12-07 20:19:56,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7434 to 6267. [2019-12-07 20:19:56,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6267 states. [2019-12-07 20:19:56,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6267 states to 6267 states and 13532 transitions. [2019-12-07 20:19:56,296 INFO L78 Accepts]: Start accepts. Automaton has 6267 states and 13532 transitions. Word has length 44 [2019-12-07 20:19:56,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:56,296 INFO L462 AbstractCegarLoop]: Abstraction has 6267 states and 13532 transitions. [2019-12-07 20:19:56,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:19:56,296 INFO L276 IsEmpty]: Start isEmpty. Operand 6267 states and 13532 transitions. [2019-12-07 20:19:56,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 20:19:56,303 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:56,303 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:56,303 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:56,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:56,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1974356745, now seen corresponding path program 1 times [2019-12-07 20:19:56,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:56,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585163623] [2019-12-07 20:19:56,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:56,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585163623] [2019-12-07 20:19:56,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:56,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:19:56,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800993511] [2019-12-07 20:19:56,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:19:56,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:56,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:19:56,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:19:56,342 INFO L87 Difference]: Start difference. First operand 6267 states and 13532 transitions. Second operand 4 states. [2019-12-07 20:19:56,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:56,421 INFO L93 Difference]: Finished difference Result 7930 states and 17023 transitions. [2019-12-07 20:19:56,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:19:56,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-07 20:19:56,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:56,427 INFO L225 Difference]: With dead ends: 7930 [2019-12-07 20:19:56,427 INFO L226 Difference]: Without dead ends: 7930 [2019-12-07 20:19:56,427 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 20:19:56,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7930 states. [2019-12-07 20:19:56,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7930 to 6825. [2019-12-07 20:19:56,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6825 states. [2019-12-07 20:19:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6825 states to 6825 states and 14762 transitions. [2019-12-07 20:19:56,493 INFO L78 Accepts]: Start accepts. Automaton has 6825 states and 14762 transitions. Word has length 68 [2019-12-07 20:19:56,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:56,493 INFO L462 AbstractCegarLoop]: Abstraction has 6825 states and 14762 transitions. [2019-12-07 20:19:56,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:19:56,493 INFO L276 IsEmpty]: Start isEmpty. Operand 6825 states and 14762 transitions. [2019-12-07 20:19:56,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 20:19:56,500 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:56,500 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:56,500 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:56,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:56,500 INFO L82 PathProgramCache]: Analyzing trace with hash -652596670, now seen corresponding path program 1 times [2019-12-07 20:19:56,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:56,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348302960] [2019-12-07 20:19:56,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:56,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:56,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348302960] [2019-12-07 20:19:56,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:56,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:19:56,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496352790] [2019-12-07 20:19:56,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:19:56,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:56,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:19:56,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:19:56,567 INFO L87 Difference]: Start difference. First operand 6825 states and 14762 transitions. Second operand 5 states. [2019-12-07 20:19:56,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:56,603 INFO L93 Difference]: Finished difference Result 7853 states and 16886 transitions. [2019-12-07 20:19:56,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:19:56,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-07 20:19:56,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:56,605 INFO L225 Difference]: With dead ends: 7853 [2019-12-07 20:19:56,605 INFO L226 Difference]: Without dead ends: 1205 [2019-12-07 20:19:56,605 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 20:19:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2019-12-07 20:19:56,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1205. [2019-12-07 20:19:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2019-12-07 20:19:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 2440 transitions. [2019-12-07 20:19:56,619 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 2440 transitions. Word has length 69 [2019-12-07 20:19:56,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:56,619 INFO L462 AbstractCegarLoop]: Abstraction has 1205 states and 2440 transitions. [2019-12-07 20:19:56,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:19:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 2440 transitions. [2019-12-07 20:19:56,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 20:19:56,620 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:56,621 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:56,621 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:56,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:56,621 INFO L82 PathProgramCache]: Analyzing trace with hash 953232845, now seen corresponding path program 1 times [2019-12-07 20:19:56,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:56,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672548913] [2019-12-07 20:19:56,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:56,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:56,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672548913] [2019-12-07 20:19:56,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:56,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:19:56,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126816235] [2019-12-07 20:19:56,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:19:56,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:56,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:19:56,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:19:56,697 INFO L87 Difference]: Start difference. First operand 1205 states and 2440 transitions. Second operand 7 states. [2019-12-07 20:19:57,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:57,033 INFO L93 Difference]: Finished difference Result 1426 states and 2845 transitions. [2019-12-07 20:19:57,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:19:57,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-07 20:19:57,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:57,034 INFO L225 Difference]: With dead ends: 1426 [2019-12-07 20:19:57,034 INFO L226 Difference]: Without dead ends: 1426 [2019-12-07 20:19:57,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:19:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2019-12-07 20:19:57,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1319. [2019-12-07 20:19:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1319 states. [2019-12-07 20:19:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 2649 transitions. [2019-12-07 20:19:57,044 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 2649 transitions. Word has length 70 [2019-12-07 20:19:57,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:57,044 INFO L462 AbstractCegarLoop]: Abstraction has 1319 states and 2649 transitions. [2019-12-07 20:19:57,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:19:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 2649 transitions. [2019-12-07 20:19:57,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 20:19:57,045 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:57,045 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:57,045 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:57,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:57,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2043869967, now seen corresponding path program 2 times [2019-12-07 20:19:57,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:57,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677938187] [2019-12-07 20:19:57,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:57,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677938187] [2019-12-07 20:19:57,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:57,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:19:57,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081591786] [2019-12-07 20:19:57,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:19:57,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:57,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:19:57,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:57,080 INFO L87 Difference]: Start difference. First operand 1319 states and 2649 transitions. Second operand 3 states. [2019-12-07 20:19:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:57,089 INFO L93 Difference]: Finished difference Result 1319 states and 2648 transitions. [2019-12-07 20:19:57,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:19:57,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-07 20:19:57,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:57,090 INFO L225 Difference]: With dead ends: 1319 [2019-12-07 20:19:57,090 INFO L226 Difference]: Without dead ends: 1319 [2019-12-07 20:19:57,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:57,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-12-07 20:19:57,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1084. [2019-12-07 20:19:57,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2019-12-07 20:19:57,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 2213 transitions. [2019-12-07 20:19:57,100 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 2213 transitions. Word has length 70 [2019-12-07 20:19:57,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:57,100 INFO L462 AbstractCegarLoop]: Abstraction has 1084 states and 2213 transitions. [2019-12-07 20:19:57,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:19:57,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 2213 transitions. [2019-12-07 20:19:57,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 20:19:57,101 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:57,101 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:57,101 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:57,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:57,101 INFO L82 PathProgramCache]: Analyzing trace with hash -101462227, now seen corresponding path program 1 times [2019-12-07 20:19:57,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:57,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12534486] [2019-12-07 20:19:57,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:57,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12534486] [2019-12-07 20:19:57,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:57,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 20:19:57,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991122357] [2019-12-07 20:19:57,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 20:19:57,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:57,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 20:19:57,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:19:57,305 INFO L87 Difference]: Start difference. First operand 1084 states and 2213 transitions. Second operand 13 states. [2019-12-07 20:19:58,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:58,271 INFO L93 Difference]: Finished difference Result 2031 states and 4093 transitions. [2019-12-07 20:19:58,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 20:19:58,271 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 71 [2019-12-07 20:19:58,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:58,272 INFO L225 Difference]: With dead ends: 2031 [2019-12-07 20:19:58,272 INFO L226 Difference]: Without dead ends: 1323 [2019-12-07 20:19:58,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2019-12-07 20:19:58,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2019-12-07 20:19:58,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1135. [2019-12-07 20:19:58,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1135 states. [2019-12-07 20:19:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 2313 transitions. [2019-12-07 20:19:58,282 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 2313 transitions. Word has length 71 [2019-12-07 20:19:58,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:58,282 INFO L462 AbstractCegarLoop]: Abstraction has 1135 states and 2313 transitions. [2019-12-07 20:19:58,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 20:19:58,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 2313 transitions. [2019-12-07 20:19:58,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 20:19:58,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:58,283 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:58,283 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:58,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:58,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1299292327, now seen corresponding path program 2 times [2019-12-07 20:19:58,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:58,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377121680] [2019-12-07 20:19:58,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:58,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:58,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377121680] [2019-12-07 20:19:58,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:58,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:19:58,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057812683] [2019-12-07 20:19:58,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:19:58,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:58,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:19:58,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:19:58,354 INFO L87 Difference]: Start difference. First operand 1135 states and 2313 transitions. Second operand 8 states. [2019-12-07 20:19:58,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:58,528 INFO L93 Difference]: Finished difference Result 2032 states and 4075 transitions. [2019-12-07 20:19:58,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 20:19:58,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2019-12-07 20:19:58,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:58,529 INFO L225 Difference]: With dead ends: 2032 [2019-12-07 20:19:58,529 INFO L226 Difference]: Without dead ends: 1494 [2019-12-07 20:19:58,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:19:58,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2019-12-07 20:19:58,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1153. [2019-12-07 20:19:58,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2019-12-07 20:19:58,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 2332 transitions. [2019-12-07 20:19:58,540 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 2332 transitions. Word has length 71 [2019-12-07 20:19:58,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:58,540 INFO L462 AbstractCegarLoop]: Abstraction has 1153 states and 2332 transitions. [2019-12-07 20:19:58,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:19:58,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 2332 transitions. [2019-12-07 20:19:58,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 20:19:58,541 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:58,541 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:58,541 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:58,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:58,541 INFO L82 PathProgramCache]: Analyzing trace with hash 477046829, now seen corresponding path program 3 times [2019-12-07 20:19:58,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:58,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153894105] [2019-12-07 20:19:58,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:19:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:19:58,613 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 20:19:58,613 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:19:58,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~main$tmp_guard0~0_19 0) (= v_~main$tmp_guard1~0_73 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1721~0.base_51| 1)) (= 0 v_~x~0_344) (= 0 v_~x$w_buff0_used~0_997) (= 0 |v_ULTIMATE.start_main_~#t1721~0.offset_32|) (= 0 v_~__unbuffered_p0_EAX~0_106) (= 0 v_~x$w_buff1~0_221) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1721~0.base_51|) (= v_~y~0_54 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff0_thd0~0_190 0) (= 0 v_~x$w_buff0~0_234) (= 0 v_~x$mem_tmp~0_169) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_599 0) (= 0 v_~__unbuffered_p1_EBX~0_105) (= v_~__unbuffered_p1_EAX~0_106 0) (= v_~x$r_buff1_thd0~0_225 0) (= 0 v_~x$w_buff1_used~0_499) (= |v_#NULL.offset_5| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1721~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1721~0.base_51|) |v_ULTIMATE.start_main_~#t1721~0.offset_32| 0)) |v_#memory_int_17|) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd2~0_403) (= v_~x$r_buff1_thd1~0_379 0) (= v_~x$flush_delayed~0_191 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1721~0.base_51|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1721~0.base_51| 4) |v_#length_17|) (= v_~weak$$choice2~0_254 0) (= 0 v_~__unbuffered_cnt~0_72) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= 0 v_~x$r_buff1_thd2~0_320))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_234, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_599, ~x$flush_delayed~0=v_~x$flush_delayed~0_191, ULTIMATE.start_main_~#t1721~0.offset=|v_ULTIMATE.start_main_~#t1721~0.offset_32|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_147|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_379, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_73, ~x$mem_tmp~0=v_~x$mem_tmp~0_169, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, #length=|v_#length_17|, ~y~0=v_~y~0_54, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_190, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ULTIMATE.start_main_~#t1722~0.offset=|v_ULTIMATE.start_main_~#t1722~0.offset_18|, ~x$w_buff1~0=v_~x$w_buff1~0_221, ULTIMATE.start_main_~#t1722~0.base=|v_ULTIMATE.start_main_~#t1722~0.base_23|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_499, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_225, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_403, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_997, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1721~0.base=|v_ULTIMATE.start_main_~#t1721~0.base_51|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~x~0=v_~x~0_344, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1721~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1722~0.offset, ~x$w_buff1~0, ULTIMATE.start_main_~#t1722~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet61, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1721~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 20:19:58,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1722~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1722~0.base_11| 1)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1722~0.base_11| 4)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1722~0.base_11|) 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1722~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1722~0.base_11|) |v_ULTIMATE.start_main_~#t1722~0.offset_10| 1))) (not (= |v_ULTIMATE.start_main_~#t1722~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t1722~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1722~0.offset=|v_ULTIMATE.start_main_~#t1722~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1722~0.base=|v_ULTIMATE.start_main_~#t1722~0.base_11|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1722~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1722~0.base, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 20:19:58,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= ~x$r_buff0_thd1~0_In-2114854903 ~x$r_buff1_thd1~0_Out-2114854903) (= ~x$r_buff1_thd2~0_Out-2114854903 ~x$r_buff0_thd2~0_In-2114854903) (= ~weak$$choice2~0_Out-2114854903 ~x$flush_delayed~0_Out-2114854903) (= ~x$mem_tmp~0_Out-2114854903 ~x~0_In-2114854903) (= ~x$r_buff0_thd0~0_In-2114854903 ~x$r_buff1_thd0~0_Out-2114854903) (= |P0Thread1of1ForFork1_#t~nondet3_In-2114854903| ~weak$$choice0~0_Out-2114854903) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-2114854903)) (= |P0Thread1of1ForFork1_#t~nondet4_In-2114854903| ~weak$$choice2~0_Out-2114854903) (= ~x$r_buff0_thd1~0_Out-2114854903 1)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2114854903, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2114854903, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-2114854903, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In-2114854903|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2114854903, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In-2114854903|, ~x~0=~x~0_In-2114854903} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2114854903, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-2114854903, ~x$flush_delayed~0=~x$flush_delayed~0_Out-2114854903, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-2114854903, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-2114854903, ~x$mem_tmp~0=~x$mem_tmp~0_Out-2114854903, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2114854903, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-2114854903, ~weak$$choice0~0=~weak$$choice0~0_Out-2114854903, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-2114854903, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out-2114854903|, ~weak$$choice2~0=~weak$$choice2~0_Out-2114854903, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out-2114854903|, ~x~0=~x~0_In-2114854903} AuxVars[] AssignedVars[~weak$$choice0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~nondet3, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] because there is no mapped edge [2019-12-07 20:19:58,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L744-2-->L744-5: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-1619786277 256))) (.cse0 (= |P0Thread1of1ForFork1_#t~ite5_Out-1619786277| |P0Thread1of1ForFork1_#t~ite6_Out-1619786277|)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1619786277 256)))) (or (and .cse0 (= |P0Thread1of1ForFork1_#t~ite5_Out-1619786277| ~x$w_buff1~0_In-1619786277) (or .cse1 .cse2)) (and (not .cse2) .cse0 (= |P0Thread1of1ForFork1_#t~ite5_Out-1619786277| ~x$w_buff0~0_In-1619786277) (not .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1619786277, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1619786277, ~x$w_buff1~0=~x$w_buff1~0_In-1619786277, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1619786277} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1619786277, P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1619786277|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1619786277, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1619786277|, ~x$w_buff1~0=~x$w_buff1~0_In-1619786277, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1619786277} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 20:19:58,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~x$r_buff0_thd1~0_87 v_~x$r_buff0_thd1~0_86)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_86, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 20:19:58,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In121659292 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite25_Out121659292| ~x$mem_tmp~0_In121659292) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork1_#t~ite25_Out121659292| ~x~0_In121659292)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In121659292, ~x$mem_tmp~0=~x$mem_tmp~0_In121659292, ~x~0=~x~0_In121659292} OutVars{P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out121659292|, ~x$flush_delayed~0=~x$flush_delayed~0_In121659292, ~x$mem_tmp~0=~x$mem_tmp~0_In121659292, ~x~0=~x~0_In121659292} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 20:19:58,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In641225676 256)))) (or (and (not .cse0) (= ~x$mem_tmp~0_In641225676 |P1Thread1of1ForFork0_#t~ite54_Out641225676|)) (and .cse0 (= ~x~0_In641225676 |P1Thread1of1ForFork0_#t~ite54_Out641225676|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In641225676, ~x$mem_tmp~0=~x$mem_tmp~0_In641225676, ~x~0=~x~0_In641225676} OutVars{P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out641225676|, ~x$flush_delayed~0=~x$flush_delayed~0_In641225676, ~x$mem_tmp~0=~x$mem_tmp~0_In641225676, ~x~0=~x~0_In641225676} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 20:19:58,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1972496233 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-1972496233 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1972496233 |P1Thread1of1ForFork0_#t~ite55_Out-1972496233|)) (and (or .cse1 .cse0) (= ~x~0_In-1972496233 |P1Thread1of1ForFork0_#t~ite55_Out-1972496233|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1972496233, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1972496233, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1972496233, ~x~0=~x~0_In-1972496233} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1972496233, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1972496233, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1972496233, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-1972496233|, ~x~0=~x~0_In-1972496233} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-07 20:19:58,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~x~0_77 |v_P1Thread1of1ForFork0_#t~ite55_8|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_8|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_11|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_7|, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~x~0] because there is no mapped edge [2019-12-07 20:19:58,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1731264837 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1731264837 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1731264837 |P1Thread1of1ForFork0_#t~ite57_Out-1731264837|)) (and (= |P1Thread1of1ForFork0_#t~ite57_Out-1731264837| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1731264837, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1731264837} OutVars{P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out-1731264837|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1731264837, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1731264837} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-07 20:19:58,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In491075311 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In491075311 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In491075311 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In491075311 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite58_Out491075311| 0)) (and (= |P1Thread1of1ForFork0_#t~ite58_Out491075311| ~x$w_buff1_used~0_In491075311) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In491075311, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In491075311, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In491075311, ~x$w_buff0_used~0=~x$w_buff0_used~0_In491075311} OutVars{P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out491075311|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In491075311, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In491075311, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In491075311, ~x$w_buff0_used~0=~x$w_buff0_used~0_In491075311} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-07 20:19:58,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In150372252 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In150372252 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In150372252 |P1Thread1of1ForFork0_#t~ite59_Out150372252|)) (and (= |P1Thread1of1ForFork0_#t~ite59_Out150372252| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In150372252, ~x$w_buff0_used~0=~x$w_buff0_used~0_In150372252} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In150372252, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out150372252|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In150372252} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-07 20:19:58,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1734395499 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1734395499 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1734395499 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1734395499 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite60_Out1734395499|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite60_Out1734395499| ~x$r_buff1_thd2~0_In1734395499)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1734395499, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1734395499, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1734395499, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1734395499} OutVars{P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out1734395499|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1734395499, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1734395499, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1734395499, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1734395499} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-07 20:19:58,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~x$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_192, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 20:19:58,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1419663997 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1419663997 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite28_Out-1419663997| 0) (not .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite28_Out-1419663997| ~x$w_buff0_used~0_In-1419663997) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1419663997, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1419663997} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1419663997, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out-1419663997|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1419663997} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 20:19:58,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L761-->L761-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-81860049 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-81860049 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-81860049 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-81860049 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite29_Out-81860049| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite29_Out-81860049| ~x$w_buff1_used~0_In-81860049) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-81860049, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-81860049, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-81860049, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-81860049} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-81860049, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out-81860049|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-81860049, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-81860049, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-81860049} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 20:19:58,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L762-->L763: Formula: (let ((.cse1 (= ~x$r_buff0_thd1~0_Out35237786 ~x$r_buff0_thd1~0_In35237786)) (.cse2 (= (mod ~x$r_buff0_thd1~0_In35237786 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In35237786 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (not .cse0) (= ~x$r_buff0_thd1~0_Out35237786 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In35237786, ~x$w_buff0_used~0=~x$w_buff0_used~0_In35237786} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out35237786, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out35237786|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In35237786} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 20:19:58,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1473954497 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1473954497 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-1473954497 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1473954497 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite31_Out-1473954497| 0)) (and (= |P0Thread1of1ForFork1_#t~ite31_Out-1473954497| ~x$r_buff1_thd1~0_In-1473954497) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1473954497, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1473954497, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1473954497, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1473954497} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1473954497, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1473954497, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1473954497, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out-1473954497|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1473954497} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 20:19:58,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= v_~x$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_34|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_34|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_33|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 20:19:58,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 20:19:58,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L826-2-->L826-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-555489271 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-555489271 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite63_Out-555489271| |ULTIMATE.start_main_#t~ite64_Out-555489271|))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-555489271| ~x$w_buff1~0_In-555489271) (not .cse0) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite63_Out-555489271| ~x~0_In-555489271) (or .cse0 .cse2) .cse1))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-555489271, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-555489271, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-555489271, ~x~0=~x~0_In-555489271} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-555489271|, ~x$w_buff1~0=~x$w_buff1~0_In-555489271, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-555489271, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-555489271, ~x~0=~x~0_In-555489271, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-555489271|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 20:19:58,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L827-->L827-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In32261697 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In32261697 256)))) (or (and (= |ULTIMATE.start_main_#t~ite65_Out32261697| ~x$w_buff0_used~0_In32261697) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite65_Out32261697| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In32261697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In32261697} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In32261697, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out32261697|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In32261697} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 20:19:58,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1593986072 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1593986072 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In1593986072 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1593986072 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite66_Out1593986072| ~x$w_buff1_used~0_In1593986072) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite66_Out1593986072| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1593986072, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1593986072, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1593986072, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1593986072} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1593986072, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1593986072, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out1593986072|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1593986072, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1593986072} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 20:19:58,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In814436792 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In814436792 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite67_Out814436792| ~x$r_buff0_thd0~0_In814436792)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite67_Out814436792| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In814436792, ~x$w_buff0_used~0=~x$w_buff0_used~0_In814436792} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In814436792, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out814436792|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In814436792} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 20:19:58,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1012] [1012] L830-->L830-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In1269971588 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1269971588 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1269971588 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1269971588 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite68_Out1269971588| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite68_Out1269971588| ~x$r_buff1_thd0~0_In1269971588) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1269971588, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1269971588, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1269971588, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1269971588} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1269971588, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1269971588, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1269971588|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1269971588, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1269971588} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 20:19:58,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_40 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_40 (ite (= (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= 1 v_~__unbuffered_p1_EAX~0_73) (= v_~__unbuffered_p0_EBX~0_47 0) (= v_~__unbuffered_p1_EBX~0_62 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~x$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_83|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_83|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:19:58,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:19:58 BasicIcfg [2019-12-07 20:19:58,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:19:58,689 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:19:58,689 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:19:58,689 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:19:58,690 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:19:33" (3/4) ... [2019-12-07 20:19:58,691 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 20:19:58,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~main$tmp_guard0~0_19 0) (= v_~main$tmp_guard1~0_73 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1721~0.base_51| 1)) (= 0 v_~x~0_344) (= 0 v_~x$w_buff0_used~0_997) (= 0 |v_ULTIMATE.start_main_~#t1721~0.offset_32|) (= 0 v_~__unbuffered_p0_EAX~0_106) (= 0 v_~x$w_buff1~0_221) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1721~0.base_51|) (= v_~y~0_54 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff0_thd0~0_190 0) (= 0 v_~x$w_buff0~0_234) (= 0 v_~x$mem_tmp~0_169) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_599 0) (= 0 v_~__unbuffered_p1_EBX~0_105) (= v_~__unbuffered_p1_EAX~0_106 0) (= v_~x$r_buff1_thd0~0_225 0) (= 0 v_~x$w_buff1_used~0_499) (= |v_#NULL.offset_5| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1721~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1721~0.base_51|) |v_ULTIMATE.start_main_~#t1721~0.offset_32| 0)) |v_#memory_int_17|) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd2~0_403) (= v_~x$r_buff1_thd1~0_379 0) (= v_~x$flush_delayed~0_191 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1721~0.base_51|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1721~0.base_51| 4) |v_#length_17|) (= v_~weak$$choice2~0_254 0) (= 0 v_~__unbuffered_cnt~0_72) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= 0 v_~x$r_buff1_thd2~0_320))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_234, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_599, ~x$flush_delayed~0=v_~x$flush_delayed~0_191, ULTIMATE.start_main_~#t1721~0.offset=|v_ULTIMATE.start_main_~#t1721~0.offset_32|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_147|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_379, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_73, ~x$mem_tmp~0=v_~x$mem_tmp~0_169, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, #length=|v_#length_17|, ~y~0=v_~y~0_54, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_190, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ULTIMATE.start_main_~#t1722~0.offset=|v_ULTIMATE.start_main_~#t1722~0.offset_18|, ~x$w_buff1~0=v_~x$w_buff1~0_221, ULTIMATE.start_main_~#t1722~0.base=|v_ULTIMATE.start_main_~#t1722~0.base_23|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_499, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_225, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_403, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_997, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1721~0.base=|v_ULTIMATE.start_main_~#t1721~0.base_51|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~x~0=v_~x~0_344, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1721~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1722~0.offset, ~x$w_buff1~0, ULTIMATE.start_main_~#t1722~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet61, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1721~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 20:19:58,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1722~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1722~0.base_11| 1)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1722~0.base_11| 4)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1722~0.base_11|) 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1722~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1722~0.base_11|) |v_ULTIMATE.start_main_~#t1722~0.offset_10| 1))) (not (= |v_ULTIMATE.start_main_~#t1722~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t1722~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1722~0.offset=|v_ULTIMATE.start_main_~#t1722~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1722~0.base=|v_ULTIMATE.start_main_~#t1722~0.base_11|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1722~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1722~0.base, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 20:19:58,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= ~x$r_buff0_thd1~0_In-2114854903 ~x$r_buff1_thd1~0_Out-2114854903) (= ~x$r_buff1_thd2~0_Out-2114854903 ~x$r_buff0_thd2~0_In-2114854903) (= ~weak$$choice2~0_Out-2114854903 ~x$flush_delayed~0_Out-2114854903) (= ~x$mem_tmp~0_Out-2114854903 ~x~0_In-2114854903) (= ~x$r_buff0_thd0~0_In-2114854903 ~x$r_buff1_thd0~0_Out-2114854903) (= |P0Thread1of1ForFork1_#t~nondet3_In-2114854903| ~weak$$choice0~0_Out-2114854903) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-2114854903)) (= |P0Thread1of1ForFork1_#t~nondet4_In-2114854903| ~weak$$choice2~0_Out-2114854903) (= ~x$r_buff0_thd1~0_Out-2114854903 1)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2114854903, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2114854903, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-2114854903, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In-2114854903|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2114854903, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In-2114854903|, ~x~0=~x~0_In-2114854903} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2114854903, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-2114854903, ~x$flush_delayed~0=~x$flush_delayed~0_Out-2114854903, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-2114854903, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-2114854903, ~x$mem_tmp~0=~x$mem_tmp~0_Out-2114854903, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2114854903, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-2114854903, ~weak$$choice0~0=~weak$$choice0~0_Out-2114854903, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-2114854903, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out-2114854903|, ~weak$$choice2~0=~weak$$choice2~0_Out-2114854903, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out-2114854903|, ~x~0=~x~0_In-2114854903} AuxVars[] AssignedVars[~weak$$choice0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~nondet3, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] because there is no mapped edge [2019-12-07 20:19:58,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L744-2-->L744-5: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-1619786277 256))) (.cse0 (= |P0Thread1of1ForFork1_#t~ite5_Out-1619786277| |P0Thread1of1ForFork1_#t~ite6_Out-1619786277|)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1619786277 256)))) (or (and .cse0 (= |P0Thread1of1ForFork1_#t~ite5_Out-1619786277| ~x$w_buff1~0_In-1619786277) (or .cse1 .cse2)) (and (not .cse2) .cse0 (= |P0Thread1of1ForFork1_#t~ite5_Out-1619786277| ~x$w_buff0~0_In-1619786277) (not .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1619786277, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1619786277, ~x$w_buff1~0=~x$w_buff1~0_In-1619786277, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1619786277} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1619786277, P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1619786277|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1619786277, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1619786277|, ~x$w_buff1~0=~x$w_buff1~0_In-1619786277, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1619786277} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 20:19:58,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~x$r_buff0_thd1~0_87 v_~x$r_buff0_thd1~0_86)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_86, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 20:19:58,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In121659292 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite25_Out121659292| ~x$mem_tmp~0_In121659292) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork1_#t~ite25_Out121659292| ~x~0_In121659292)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In121659292, ~x$mem_tmp~0=~x$mem_tmp~0_In121659292, ~x~0=~x~0_In121659292} OutVars{P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out121659292|, ~x$flush_delayed~0=~x$flush_delayed~0_In121659292, ~x$mem_tmp~0=~x$mem_tmp~0_In121659292, ~x~0=~x~0_In121659292} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 20:19:58,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In641225676 256)))) (or (and (not .cse0) (= ~x$mem_tmp~0_In641225676 |P1Thread1of1ForFork0_#t~ite54_Out641225676|)) (and .cse0 (= ~x~0_In641225676 |P1Thread1of1ForFork0_#t~ite54_Out641225676|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In641225676, ~x$mem_tmp~0=~x$mem_tmp~0_In641225676, ~x~0=~x~0_In641225676} OutVars{P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out641225676|, ~x$flush_delayed~0=~x$flush_delayed~0_In641225676, ~x$mem_tmp~0=~x$mem_tmp~0_In641225676, ~x~0=~x~0_In641225676} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 20:19:58,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1972496233 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-1972496233 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1972496233 |P1Thread1of1ForFork0_#t~ite55_Out-1972496233|)) (and (or .cse1 .cse0) (= ~x~0_In-1972496233 |P1Thread1of1ForFork0_#t~ite55_Out-1972496233|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1972496233, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1972496233, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1972496233, ~x~0=~x~0_In-1972496233} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1972496233, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1972496233, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1972496233, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-1972496233|, ~x~0=~x~0_In-1972496233} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-07 20:19:58,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~x~0_77 |v_P1Thread1of1ForFork0_#t~ite55_8|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_8|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_11|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_7|, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~x~0] because there is no mapped edge [2019-12-07 20:19:58,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1731264837 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1731264837 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1731264837 |P1Thread1of1ForFork0_#t~ite57_Out-1731264837|)) (and (= |P1Thread1of1ForFork0_#t~ite57_Out-1731264837| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1731264837, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1731264837} OutVars{P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out-1731264837|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1731264837, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1731264837} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-07 20:19:58,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In491075311 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In491075311 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In491075311 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In491075311 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite58_Out491075311| 0)) (and (= |P1Thread1of1ForFork0_#t~ite58_Out491075311| ~x$w_buff1_used~0_In491075311) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In491075311, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In491075311, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In491075311, ~x$w_buff0_used~0=~x$w_buff0_used~0_In491075311} OutVars{P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out491075311|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In491075311, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In491075311, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In491075311, ~x$w_buff0_used~0=~x$w_buff0_used~0_In491075311} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-07 20:19:58,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In150372252 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In150372252 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In150372252 |P1Thread1of1ForFork0_#t~ite59_Out150372252|)) (and (= |P1Thread1of1ForFork0_#t~ite59_Out150372252| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In150372252, ~x$w_buff0_used~0=~x$w_buff0_used~0_In150372252} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In150372252, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out150372252|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In150372252} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-07 20:19:58,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1734395499 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1734395499 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1734395499 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1734395499 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite60_Out1734395499|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite60_Out1734395499| ~x$r_buff1_thd2~0_In1734395499)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1734395499, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1734395499, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1734395499, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1734395499} OutVars{P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out1734395499|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1734395499, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1734395499, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1734395499, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1734395499} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-07 20:19:58,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~x$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_192, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 20:19:58,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1419663997 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1419663997 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite28_Out-1419663997| 0) (not .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite28_Out-1419663997| ~x$w_buff0_used~0_In-1419663997) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1419663997, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1419663997} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1419663997, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out-1419663997|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1419663997} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 20:19:58,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L761-->L761-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-81860049 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-81860049 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-81860049 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-81860049 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite29_Out-81860049| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite29_Out-81860049| ~x$w_buff1_used~0_In-81860049) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-81860049, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-81860049, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-81860049, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-81860049} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-81860049, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out-81860049|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-81860049, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-81860049, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-81860049} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 20:19:58,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L762-->L763: Formula: (let ((.cse1 (= ~x$r_buff0_thd1~0_Out35237786 ~x$r_buff0_thd1~0_In35237786)) (.cse2 (= (mod ~x$r_buff0_thd1~0_In35237786 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In35237786 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (not .cse0) (= ~x$r_buff0_thd1~0_Out35237786 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In35237786, ~x$w_buff0_used~0=~x$w_buff0_used~0_In35237786} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out35237786, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out35237786|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In35237786} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 20:19:58,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1473954497 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1473954497 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-1473954497 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1473954497 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite31_Out-1473954497| 0)) (and (= |P0Thread1of1ForFork1_#t~ite31_Out-1473954497| ~x$r_buff1_thd1~0_In-1473954497) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1473954497, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1473954497, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1473954497, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1473954497} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1473954497, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1473954497, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1473954497, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out-1473954497|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1473954497} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 20:19:58,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= v_~x$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_34|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_34|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_33|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 20:19:58,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 20:19:58,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L826-2-->L826-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-555489271 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-555489271 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite63_Out-555489271| |ULTIMATE.start_main_#t~ite64_Out-555489271|))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-555489271| ~x$w_buff1~0_In-555489271) (not .cse0) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite63_Out-555489271| ~x~0_In-555489271) (or .cse0 .cse2) .cse1))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-555489271, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-555489271, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-555489271, ~x~0=~x~0_In-555489271} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-555489271|, ~x$w_buff1~0=~x$w_buff1~0_In-555489271, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-555489271, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-555489271, ~x~0=~x~0_In-555489271, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-555489271|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 20:19:58,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L827-->L827-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In32261697 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In32261697 256)))) (or (and (= |ULTIMATE.start_main_#t~ite65_Out32261697| ~x$w_buff0_used~0_In32261697) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite65_Out32261697| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In32261697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In32261697} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In32261697, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out32261697|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In32261697} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 20:19:58,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1593986072 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1593986072 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In1593986072 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1593986072 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite66_Out1593986072| ~x$w_buff1_used~0_In1593986072) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite66_Out1593986072| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1593986072, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1593986072, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1593986072, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1593986072} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1593986072, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1593986072, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out1593986072|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1593986072, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1593986072} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 20:19:58,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In814436792 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In814436792 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite67_Out814436792| ~x$r_buff0_thd0~0_In814436792)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite67_Out814436792| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In814436792, ~x$w_buff0_used~0=~x$w_buff0_used~0_In814436792} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In814436792, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out814436792|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In814436792} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 20:19:58,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1012] [1012] L830-->L830-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In1269971588 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1269971588 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1269971588 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1269971588 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite68_Out1269971588| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite68_Out1269971588| ~x$r_buff1_thd0~0_In1269971588) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1269971588, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1269971588, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1269971588, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1269971588} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1269971588, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1269971588, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1269971588|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1269971588, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1269971588} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 20:19:58,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_40 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_40 (ite (= (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= 1 v_~__unbuffered_p1_EAX~0_73) (= v_~__unbuffered_p0_EBX~0_47 0) (= v_~__unbuffered_p1_EBX~0_62 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~x$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_83|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_83|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:19:58,764 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_dd1dc266-5cf2-4fa4-817f-0a6e7f4508da/bin/utaipan/witness.graphml [2019-12-07 20:19:58,764 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:19:58,765 INFO L168 Benchmark]: Toolchain (without parser) took 26362.31 ms. Allocated memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: 2.5 GB). Free memory was 936.2 MB in the beginning and 1.4 GB in the end (delta: -486.0 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-12-07 20:19:58,765 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 956.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:19:58,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:58,765 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:58,766 INFO L168 Benchmark]: Boogie Preprocessor took 26.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:58,766 INFO L168 Benchmark]: RCFGBuilder took 457.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.8 MB). Peak memory consumption was 61.8 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:58,766 INFO L168 Benchmark]: TraceAbstraction took 25361.27 ms. Allocated memory was 1.2 GB in the beginning and 3.6 GB in the end (delta: 2.4 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -429.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-12-07 20:19:58,767 INFO L168 Benchmark]: Witness Printer took 74.77 ms. Allocated memory is still 3.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:58,768 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 956.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 397.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 457.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.8 MB). Peak memory consumption was 61.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25361.27 ms. Allocated memory was 1.2 GB in the beginning and 3.6 GB in the end (delta: 2.4 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -429.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 74.77 ms. Allocated memory is still 3.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 191 ProgramPointsBefore, 113 ProgramPointsAfterwards, 246 TransitionsBefore, 136 TransitionsAfterwards, 27428 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 35 ChoiceCompositions, 9685 VarBasedMoverChecksPositive, 320 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 419 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 146813 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1721, ((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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1722, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 x$w_buff1 = x$w_buff0 [L730] 1 x$w_buff0 = 1 [L731] 1 x$w_buff1_used = x$w_buff0_used [L732] 1 x$w_buff0_used = (_Bool)1 [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L745] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L746] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L746] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L747] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L748] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 1 x = x$flush_delayed ? x$mem_tmp : x [L753] 1 x$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 [L776] 2 __unbuffered_p1_EAX = y [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 x$flush_delayed = weak$$choice2 [L782] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L784] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L784] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L785] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L786] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L786] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L787] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L788] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L789] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L791] 2 x = x$flush_delayed ? x$mem_tmp : x [L792] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 25.1s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4870 SDtfs, 4266 SDslu, 9607 SDs, 0 SdLazy, 5429 SolverSat, 200 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 49 SyntacticMatches, 16 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74579occurred 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: 11.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 40847 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 902 NumberOfCodeBlocks, 902 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 809 ConstructedInterpolants, 0 QuantifiedInterpolants, 231734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...