./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe017_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9354baaa-4f80-4ff5-817b-cf03493046f0/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9354baaa-4f80-4ff5-817b-cf03493046f0/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9354baaa-4f80-4ff5-817b-cf03493046f0/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9354baaa-4f80-4ff5-817b-cf03493046f0/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe017_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9354baaa-4f80-4ff5-817b-cf03493046f0/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9354baaa-4f80-4ff5-817b-cf03493046f0/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 0885e64468ef53ddb31131d4fa176c00edab8093 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 19:21:20,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:21:20,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:21:20,869 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:21:20,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:21:20,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:21:20,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:21:20,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:21:20,873 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:21:20,874 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:21:20,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:21:20,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:21:20,876 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:21:20,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:21:20,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:21:20,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:21:20,878 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:21:20,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:21:20,880 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:21:20,882 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:21:20,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:21:20,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:21:20,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:21:20,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:21:20,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:21:20,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:21:20,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:21:20,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:21:20,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:21:20,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:21:20,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:21:20,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:21:20,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:21:20,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:21:20,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:21:20,890 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:21:20,890 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:21:20,890 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:21:20,891 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:21:20,891 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:21:20,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:21:20,892 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9354baaa-4f80-4ff5-817b-cf03493046f0/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:21:20,901 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:21:20,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:21:20,902 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:21:20,902 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:21:20,902 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:21:20,902 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:21:20,902 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:21:20,902 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:21:20,903 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:21:20,903 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:21:20,903 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:21:20,903 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:21:20,903 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:21:20,903 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:21:20,903 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:21:20,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:21:20,904 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:21:20,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:21:20,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:21:20,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:21:20,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:21:20,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:21:20,904 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:21:20,905 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:21:20,905 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:21:20,905 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:21:20,905 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:21:20,905 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:21:20,905 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:21:20,905 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:21:20,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:21:20,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:21:20,906 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:21:20,906 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:21:20,906 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:21:20,906 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:21:20,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:21:20,906 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:21:20,906 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:21:20,906 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:21:20,907 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_9354baaa-4f80-4ff5-817b-cf03493046f0/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 -> 0885e64468ef53ddb31131d4fa176c00edab8093 [2019-12-07 19:21:21,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:21:21,025 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:21:21,028 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:21:21,029 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:21:21,030 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:21:21,030 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9354baaa-4f80-4ff5-817b-cf03493046f0/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe017_pso.opt.i [2019-12-07 19:21:21,073 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9354baaa-4f80-4ff5-817b-cf03493046f0/bin/utaipan/data/7657f3b55/7bbf012b5b12472499def16c6a0de9ad/FLAGe4424195a [2019-12-07 19:21:21,445 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:21:21,446 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9354baaa-4f80-4ff5-817b-cf03493046f0/sv-benchmarks/c/pthread-wmm/safe017_pso.opt.i [2019-12-07 19:21:21,455 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9354baaa-4f80-4ff5-817b-cf03493046f0/bin/utaipan/data/7657f3b55/7bbf012b5b12472499def16c6a0de9ad/FLAGe4424195a [2019-12-07 19:21:21,464 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9354baaa-4f80-4ff5-817b-cf03493046f0/bin/utaipan/data/7657f3b55/7bbf012b5b12472499def16c6a0de9ad [2019-12-07 19:21:21,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:21:21,467 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:21:21,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:21:21,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:21:21,470 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:21:21,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:21:21" (1/1) ... [2019-12-07 19:21:21,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:21, skipping insertion in model container [2019-12-07 19:21:21,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:21:21" (1/1) ... [2019-12-07 19:21:21,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:21:21,504 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:21:21,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:21:21,782 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:21:21,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:21:21,885 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:21:21,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:21 WrapperNode [2019-12-07 19:21:21,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:21:21,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:21:21,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:21:21,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:21:21,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:21" (1/1) ... [2019-12-07 19:21:21,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:21" (1/1) ... [2019-12-07 19:21:21,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:21:21,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:21:21,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:21:21,931 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:21:21,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:21" (1/1) ... [2019-12-07 19:21:21,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:21" (1/1) ... [2019-12-07 19:21:21,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:21" (1/1) ... [2019-12-07 19:21:21,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:21" (1/1) ... [2019-12-07 19:21:21,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:21" (1/1) ... [2019-12-07 19:21:21,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:21" (1/1) ... [2019-12-07 19:21:21,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:21" (1/1) ... [2019-12-07 19:21:21,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:21:21,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:21:21,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:21:21,965 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:21:21,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9354baaa-4f80-4ff5-817b-cf03493046f0/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:21:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:21:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 19:21:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:21:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:21:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 19:21:22,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 19:21:22,006 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 19:21:22,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 19:21:22,006 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 19:21:22,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 19:21:22,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 19:21:22,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:21:22,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:21:22,007 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 19:21:22,375 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:21:22,375 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 19:21:22,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:21:22 BoogieIcfgContainer [2019-12-07 19:21:22,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:21:22,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:21:22,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:21:22,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:21:22,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:21:21" (1/3) ... [2019-12-07 19:21:22,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@542c3658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:21:22, skipping insertion in model container [2019-12-07 19:21:22,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:21" (2/3) ... [2019-12-07 19:21:22,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@542c3658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:21:22, skipping insertion in model container [2019-12-07 19:21:22,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:21:22" (3/3) ... [2019-12-07 19:21:22,383 INFO L109 eAbstractionObserver]: Analyzing ICFG safe017_pso.opt.i [2019-12-07 19:21:22,391 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 19:21:22,392 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:21:22,398 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 19:21:22,399 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 19:21:22,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,427 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,427 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,427 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,428 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,428 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,431 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,431 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,435 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,435 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:22,449 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 19:21:22,461 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:21:22,461 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:21:22,461 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:21:22,461 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:21:22,461 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:21:22,461 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:21:22,461 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:21:22,461 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:21:22,472 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-07 19:21:22,473 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-07 19:21:22,526 INFO L134 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-07 19:21:22,526 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:21:22,536 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 585 event pairs. 9/167 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 19:21:22,550 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-07 19:21:22,578 INFO L134 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-07 19:21:22,579 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:21:22,583 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 585 event pairs. 9/167 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 19:21:22,597 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-07 19:21:22,598 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 19:21:25,445 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 19:21:25,528 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78185 [2019-12-07 19:21:25,529 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-07 19:21:25,532 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-07 19:21:38,631 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 112926 states. [2019-12-07 19:21:38,633 INFO L276 IsEmpty]: Start isEmpty. Operand 112926 states. [2019-12-07 19:21:38,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 19:21:38,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:38,637 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 19:21:38,637 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:38,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:38,641 INFO L82 PathProgramCache]: Analyzing trace with hash 844394, now seen corresponding path program 1 times [2019-12-07 19:21:38,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:38,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966250634] [2019-12-07 19:21:38,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:38,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966250634] [2019-12-07 19:21:38,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:38,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:21:38,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735138278] [2019-12-07 19:21:38,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:21:38,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:38,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:21:38,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:21:38,798 INFO L87 Difference]: Start difference. First operand 112926 states. Second operand 3 states. [2019-12-07 19:21:39,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:39,695 INFO L93 Difference]: Finished difference Result 112536 states and 479624 transitions. [2019-12-07 19:21:39,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:21:39,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 19:21:39,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:40,294 INFO L225 Difference]: With dead ends: 112536 [2019-12-07 19:21:40,295 INFO L226 Difference]: Without dead ends: 110184 [2019-12-07 19:21:40,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:21:43,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110184 states. [2019-12-07 19:21:45,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110184 to 110184. [2019-12-07 19:21:45,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110184 states. [2019-12-07 19:21:45,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110184 states to 110184 states and 470020 transitions. [2019-12-07 19:21:45,699 INFO L78 Accepts]: Start accepts. Automaton has 110184 states and 470020 transitions. Word has length 3 [2019-12-07 19:21:45,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:45,699 INFO L462 AbstractCegarLoop]: Abstraction has 110184 states and 470020 transitions. [2019-12-07 19:21:45,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:21:45,699 INFO L276 IsEmpty]: Start isEmpty. Operand 110184 states and 470020 transitions. [2019-12-07 19:21:45,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 19:21:45,703 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:45,703 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:21:45,703 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:45,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:45,704 INFO L82 PathProgramCache]: Analyzing trace with hash -418531443, now seen corresponding path program 1 times [2019-12-07 19:21:45,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:45,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470091666] [2019-12-07 19:21:45,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:45,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470091666] [2019-12-07 19:21:45,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:45,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:21:45,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099925608] [2019-12-07 19:21:45,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:21:45,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:45,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:21:45,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:21:45,781 INFO L87 Difference]: Start difference. First operand 110184 states and 470020 transitions. Second operand 4 states. [2019-12-07 19:21:48,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:48,328 INFO L93 Difference]: Finished difference Result 172298 states and 706272 transitions. [2019-12-07 19:21:48,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:21:48,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 19:21:48,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:48,769 INFO L225 Difference]: With dead ends: 172298 [2019-12-07 19:21:48,769 INFO L226 Difference]: Without dead ends: 172249 [2019-12-07 19:21:48,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:21:53,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172249 states. [2019-12-07 19:21:55,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172249 to 156321. [2019-12-07 19:21:55,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156321 states. [2019-12-07 19:21:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156321 states to 156321 states and 647667 transitions. [2019-12-07 19:21:55,646 INFO L78 Accepts]: Start accepts. Automaton has 156321 states and 647667 transitions. Word has length 11 [2019-12-07 19:21:55,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:55,646 INFO L462 AbstractCegarLoop]: Abstraction has 156321 states and 647667 transitions. [2019-12-07 19:21:55,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:21:55,646 INFO L276 IsEmpty]: Start isEmpty. Operand 156321 states and 647667 transitions. [2019-12-07 19:21:55,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:21:55,651 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:55,651 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:21:55,651 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:55,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:55,651 INFO L82 PathProgramCache]: Analyzing trace with hash -986312255, now seen corresponding path program 1 times [2019-12-07 19:21:55,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:55,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830377605] [2019-12-07 19:21:55,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:55,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830377605] [2019-12-07 19:21:55,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:55,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:21:55,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232318137] [2019-12-07 19:21:55,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:21:55,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:55,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:21:55,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:21:55,692 INFO L87 Difference]: Start difference. First operand 156321 states and 647667 transitions. Second operand 3 states. [2019-12-07 19:21:55,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:55,783 INFO L93 Difference]: Finished difference Result 32129 states and 104196 transitions. [2019-12-07 19:21:55,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:21:55,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 19:21:55,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:55,834 INFO L225 Difference]: With dead ends: 32129 [2019-12-07 19:21:55,834 INFO L226 Difference]: Without dead ends: 32129 [2019-12-07 19:21:55,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:21:55,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32129 states. [2019-12-07 19:21:56,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32129 to 32129. [2019-12-07 19:21:56,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32129 states. [2019-12-07 19:21:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32129 states to 32129 states and 104196 transitions. [2019-12-07 19:21:56,391 INFO L78 Accepts]: Start accepts. Automaton has 32129 states and 104196 transitions. Word has length 13 [2019-12-07 19:21:56,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:56,391 INFO L462 AbstractCegarLoop]: Abstraction has 32129 states and 104196 transitions. [2019-12-07 19:21:56,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:21:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 32129 states and 104196 transitions. [2019-12-07 19:21:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:21:56,392 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:56,393 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:21:56,393 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:56,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:56,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1176456771, now seen corresponding path program 1 times [2019-12-07 19:21:56,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:56,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649659244] [2019-12-07 19:21:56,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:56,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649659244] [2019-12-07 19:21:56,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:56,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:21:56,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080940380] [2019-12-07 19:21:56,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:21:56,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:56,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:21:56,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:21:56,458 INFO L87 Difference]: Start difference. First operand 32129 states and 104196 transitions. Second operand 4 states. [2019-12-07 19:21:57,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:57,078 INFO L93 Difference]: Finished difference Result 43159 states and 136814 transitions. [2019-12-07 19:21:57,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:21:57,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 19:21:57,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:57,140 INFO L225 Difference]: With dead ends: 43159 [2019-12-07 19:21:57,140 INFO L226 Difference]: Without dead ends: 43152 [2019-12-07 19:21:57,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:21:57,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43152 states. [2019-12-07 19:21:57,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43152 to 37631. [2019-12-07 19:21:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37631 states. [2019-12-07 19:21:57,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37631 states to 37631 states and 121166 transitions. [2019-12-07 19:21:57,786 INFO L78 Accepts]: Start accepts. Automaton has 37631 states and 121166 transitions. Word has length 13 [2019-12-07 19:21:57,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:57,786 INFO L462 AbstractCegarLoop]: Abstraction has 37631 states and 121166 transitions. [2019-12-07 19:21:57,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:21:57,786 INFO L276 IsEmpty]: Start isEmpty. Operand 37631 states and 121166 transitions. [2019-12-07 19:21:57,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:21:57,790 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:57,790 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:21:57,790 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:57,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:57,790 INFO L82 PathProgramCache]: Analyzing trace with hash -2012510844, now seen corresponding path program 1 times [2019-12-07 19:21:57,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:57,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137944352] [2019-12-07 19:21:57,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:57,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137944352] [2019-12-07 19:21:57,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:57,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:21:57,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183018139] [2019-12-07 19:21:57,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:21:57,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:57,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:21:57,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:21:57,864 INFO L87 Difference]: Start difference. First operand 37631 states and 121166 transitions. Second operand 5 states. [2019-12-07 19:21:58,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:58,354 INFO L93 Difference]: Finished difference Result 50788 states and 160280 transitions. [2019-12-07 19:21:58,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:21:58,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 19:21:58,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:58,434 INFO L225 Difference]: With dead ends: 50788 [2019-12-07 19:21:58,434 INFO L226 Difference]: Without dead ends: 50775 [2019-12-07 19:21:58,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:21:58,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50775 states. [2019-12-07 19:21:59,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50775 to 38059. [2019-12-07 19:21:59,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38059 states. [2019-12-07 19:21:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38059 states to 38059 states and 122380 transitions. [2019-12-07 19:21:59,144 INFO L78 Accepts]: Start accepts. Automaton has 38059 states and 122380 transitions. Word has length 19 [2019-12-07 19:21:59,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:59,145 INFO L462 AbstractCegarLoop]: Abstraction has 38059 states and 122380 transitions. [2019-12-07 19:21:59,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:21:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 38059 states and 122380 transitions. [2019-12-07 19:21:59,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 19:21:59,153 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:59,153 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:21:59,153 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:59,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:59,154 INFO L82 PathProgramCache]: Analyzing trace with hash -394195806, now seen corresponding path program 1 times [2019-12-07 19:21:59,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:59,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38357397] [2019-12-07 19:21:59,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:59,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:59,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38357397] [2019-12-07 19:21:59,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:59,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:21:59,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287928489] [2019-12-07 19:21:59,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:21:59,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:59,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:21:59,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:21:59,189 INFO L87 Difference]: Start difference. First operand 38059 states and 122380 transitions. Second operand 4 states. [2019-12-07 19:21:59,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:59,219 INFO L93 Difference]: Finished difference Result 7382 states and 20162 transitions. [2019-12-07 19:21:59,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:21:59,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 19:21:59,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:59,226 INFO L225 Difference]: With dead ends: 7382 [2019-12-07 19:21:59,226 INFO L226 Difference]: Without dead ends: 7382 [2019-12-07 19:21:59,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:21:59,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-12-07 19:21:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7270. [2019-12-07 19:21:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7270 states. [2019-12-07 19:21:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7270 states to 7270 states and 19842 transitions. [2019-12-07 19:21:59,312 INFO L78 Accepts]: Start accepts. Automaton has 7270 states and 19842 transitions. Word has length 25 [2019-12-07 19:21:59,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:59,313 INFO L462 AbstractCegarLoop]: Abstraction has 7270 states and 19842 transitions. [2019-12-07 19:21:59,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:21:59,313 INFO L276 IsEmpty]: Start isEmpty. Operand 7270 states and 19842 transitions. [2019-12-07 19:21:59,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 19:21:59,322 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:59,322 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] [2019-12-07 19:21:59,322 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:59,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:59,322 INFO L82 PathProgramCache]: Analyzing trace with hash 56145512, now seen corresponding path program 1 times [2019-12-07 19:21:59,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:59,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958082568] [2019-12-07 19:21:59,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:59,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958082568] [2019-12-07 19:21:59,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:59,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:21:59,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249290366] [2019-12-07 19:21:59,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:21:59,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:59,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:21:59,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:21:59,425 INFO L87 Difference]: Start difference. First operand 7270 states and 19842 transitions. Second operand 6 states. [2019-12-07 19:21:59,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:59,830 INFO L93 Difference]: Finished difference Result 8364 states and 22172 transitions. [2019-12-07 19:21:59,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:21:59,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-07 19:21:59,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:59,837 INFO L225 Difference]: With dead ends: 8364 [2019-12-07 19:21:59,837 INFO L226 Difference]: Without dead ends: 8364 [2019-12-07 19:21:59,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:21:59,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8364 states. [2019-12-07 19:21:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8364 to 7743. [2019-12-07 19:21:59,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7743 states. [2019-12-07 19:21:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7743 states to 7743 states and 20803 transitions. [2019-12-07 19:21:59,929 INFO L78 Accepts]: Start accepts. Automaton has 7743 states and 20803 transitions. Word has length 37 [2019-12-07 19:21:59,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:59,929 INFO L462 AbstractCegarLoop]: Abstraction has 7743 states and 20803 transitions. [2019-12-07 19:21:59,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:21:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 7743 states and 20803 transitions. [2019-12-07 19:21:59,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 19:21:59,938 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:59,938 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] [2019-12-07 19:21:59,938 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:59,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:59,938 INFO L82 PathProgramCache]: Analyzing trace with hash -2110715921, now seen corresponding path program 1 times [2019-12-07 19:21:59,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:59,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402901964] [2019-12-07 19:21:59,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:00,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:00,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402901964] [2019-12-07 19:22:00,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:00,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:22:00,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22420123] [2019-12-07 19:22:00,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:22:00,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:00,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:22:00,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:22:00,067 INFO L87 Difference]: Start difference. First operand 7743 states and 20803 transitions. Second operand 8 states. [2019-12-07 19:22:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:01,280 INFO L93 Difference]: Finished difference Result 9015 states and 23525 transitions. [2019-12-07 19:22:01,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 19:22:01,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-12-07 19:22:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:01,287 INFO L225 Difference]: With dead ends: 9015 [2019-12-07 19:22:01,287 INFO L226 Difference]: Without dead ends: 9013 [2019-12-07 19:22:01,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-12-07 19:22:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9013 states. [2019-12-07 19:22:01,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9013 to 8256. [2019-12-07 19:22:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8256 states. [2019-12-07 19:22:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8256 states to 8256 states and 21873 transitions. [2019-12-07 19:22:01,377 INFO L78 Accepts]: Start accepts. Automaton has 8256 states and 21873 transitions. Word has length 51 [2019-12-07 19:22:01,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:01,378 INFO L462 AbstractCegarLoop]: Abstraction has 8256 states and 21873 transitions. [2019-12-07 19:22:01,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:22:01,378 INFO L276 IsEmpty]: Start isEmpty. Operand 8256 states and 21873 transitions. [2019-12-07 19:22:01,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:22:01,386 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:01,387 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:01,387 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:01,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:01,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1899406467, now seen corresponding path program 1 times [2019-12-07 19:22:01,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:01,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090906684] [2019-12-07 19:22:01,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:01,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090906684] [2019-12-07 19:22:01,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:01,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:22:01,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511308269] [2019-12-07 19:22:01,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:22:01,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:01,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:22:01,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:01,428 INFO L87 Difference]: Start difference. First operand 8256 states and 21873 transitions. Second operand 3 states. [2019-12-07 19:22:01,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:01,479 INFO L93 Difference]: Finished difference Result 8814 states and 23166 transitions. [2019-12-07 19:22:01,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:22:01,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 19:22:01,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:01,486 INFO L225 Difference]: With dead ends: 8814 [2019-12-07 19:22:01,486 INFO L226 Difference]: Without dead ends: 8814 [2019-12-07 19:22:01,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:01,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8814 states. [2019-12-07 19:22:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8814 to 8442. [2019-12-07 19:22:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8442 states. [2019-12-07 19:22:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8442 states to 8442 states and 22424 transitions. [2019-12-07 19:22:01,582 INFO L78 Accepts]: Start accepts. Automaton has 8442 states and 22424 transitions. Word has length 54 [2019-12-07 19:22:01,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:01,582 INFO L462 AbstractCegarLoop]: Abstraction has 8442 states and 22424 transitions. [2019-12-07 19:22:01,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:22:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 8442 states and 22424 transitions. [2019-12-07 19:22:01,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:22:01,591 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:01,592 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:01,592 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:01,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:01,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1441289202, now seen corresponding path program 1 times [2019-12-07 19:22:01,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:01,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120075910] [2019-12-07 19:22:01,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:01,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120075910] [2019-12-07 19:22:01,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:01,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:22:01,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686135890] [2019-12-07 19:22:01,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:22:01,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:01,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:22:01,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:22:01,632 INFO L87 Difference]: Start difference. First operand 8442 states and 22424 transitions. Second operand 5 states. [2019-12-07 19:22:01,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:01,655 INFO L93 Difference]: Finished difference Result 5347 states and 15308 transitions. [2019-12-07 19:22:01,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:22:01,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-07 19:22:01,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:01,660 INFO L225 Difference]: With dead ends: 5347 [2019-12-07 19:22:01,661 INFO L226 Difference]: Without dead ends: 5347 [2019-12-07 19:22:01,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:22:01,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5347 states. [2019-12-07 19:22:01,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5347 to 4983. [2019-12-07 19:22:01,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4983 states. [2019-12-07 19:22:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 14324 transitions. [2019-12-07 19:22:01,727 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 14324 transitions. Word has length 54 [2019-12-07 19:22:01,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:01,727 INFO L462 AbstractCegarLoop]: Abstraction has 4983 states and 14324 transitions. [2019-12-07 19:22:01,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:22:01,727 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 14324 transitions. [2019-12-07 19:22:01,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 19:22:01,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:01,733 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:01,734 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:01,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:01,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1838424094, now seen corresponding path program 1 times [2019-12-07 19:22:01,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:01,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488735486] [2019-12-07 19:22:01,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:01,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 19:22:01,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488735486] [2019-12-07 19:22:01,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:01,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:22:01,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170690250] [2019-12-07 19:22:01,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:22:01,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:01,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:22:01,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:01,776 INFO L87 Difference]: Start difference. First operand 4983 states and 14324 transitions. Second operand 3 states. [2019-12-07 19:22:01,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:01,812 INFO L93 Difference]: Finished difference Result 4983 states and 14323 transitions. [2019-12-07 19:22:01,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:22:01,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 19:22:01,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:01,817 INFO L225 Difference]: With dead ends: 4983 [2019-12-07 19:22:01,817 INFO L226 Difference]: Without dead ends: 4983 [2019-12-07 19:22:01,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:01,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4983 states. [2019-12-07 19:22:01,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4983 to 4983. [2019-12-07 19:22:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4983 states. [2019-12-07 19:22:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 14323 transitions. [2019-12-07 19:22:01,878 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 14323 transitions. Word has length 65 [2019-12-07 19:22:01,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:01,878 INFO L462 AbstractCegarLoop]: Abstraction has 4983 states and 14323 transitions. [2019-12-07 19:22:01,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:22:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 14323 transitions. [2019-12-07 19:22:01,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 19:22:01,884 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:01,884 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:01,885 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:01,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:01,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1776506769, now seen corresponding path program 1 times [2019-12-07 19:22:01,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:01,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236805096] [2019-12-07 19:22:01,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:01,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236805096] [2019-12-07 19:22:01,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:01,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:22:01,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887008310] [2019-12-07 19:22:01,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:22:01,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:01,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:22:01,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:01,929 INFO L87 Difference]: Start difference. First operand 4983 states and 14323 transitions. Second operand 3 states. [2019-12-07 19:22:01,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:01,950 INFO L93 Difference]: Finished difference Result 4719 states and 13370 transitions. [2019-12-07 19:22:01,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:22:01,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 19:22:01,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:01,955 INFO L225 Difference]: With dead ends: 4719 [2019-12-07 19:22:01,956 INFO L226 Difference]: Without dead ends: 4719 [2019-12-07 19:22:01,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:01,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4719 states. [2019-12-07 19:22:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4719 to 4719. [2019-12-07 19:22:02,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4719 states. [2019-12-07 19:22:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4719 states to 4719 states and 13370 transitions. [2019-12-07 19:22:02,012 INFO L78 Accepts]: Start accepts. Automaton has 4719 states and 13370 transitions. Word has length 66 [2019-12-07 19:22:02,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:02,012 INFO L462 AbstractCegarLoop]: Abstraction has 4719 states and 13370 transitions. [2019-12-07 19:22:02,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:22:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 4719 states and 13370 transitions. [2019-12-07 19:22:02,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 19:22:02,017 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:02,017 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] [2019-12-07 19:22:02,017 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:02,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:02,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1474263877, now seen corresponding path program 1 times [2019-12-07 19:22:02,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:02,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292616996] [2019-12-07 19:22:02,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:02,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292616996] [2019-12-07 19:22:02,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:02,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 19:22:02,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876537874] [2019-12-07 19:22:02,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 19:22:02,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:02,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 19:22:02,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:22:02,210 INFO L87 Difference]: Start difference. First operand 4719 states and 13370 transitions. Second operand 14 states. [2019-12-07 19:22:02,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:02,655 INFO L93 Difference]: Finished difference Result 8589 states and 24328 transitions. [2019-12-07 19:22:02,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 19:22:02,655 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-07 19:22:02,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:02,662 INFO L225 Difference]: With dead ends: 8589 [2019-12-07 19:22:02,662 INFO L226 Difference]: Without dead ends: 7813 [2019-12-07 19:22:02,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=736, Unknown=0, NotChecked=0, Total=930 [2019-12-07 19:22:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7813 states. [2019-12-07 19:22:02,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7813 to 5944. [2019-12-07 19:22:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5944 states. [2019-12-07 19:22:02,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5944 states to 5944 states and 16718 transitions. [2019-12-07 19:22:02,743 INFO L78 Accepts]: Start accepts. Automaton has 5944 states and 16718 transitions. Word has length 67 [2019-12-07 19:22:02,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:02,743 INFO L462 AbstractCegarLoop]: Abstraction has 5944 states and 16718 transitions. [2019-12-07 19:22:02,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 19:22:02,744 INFO L276 IsEmpty]: Start isEmpty. Operand 5944 states and 16718 transitions. [2019-12-07 19:22:02,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 19:22:02,750 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:02,750 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] [2019-12-07 19:22:02,751 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:02,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:02,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1772687019, now seen corresponding path program 2 times [2019-12-07 19:22:02,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:02,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975372583] [2019-12-07 19:22:02,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:02,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975372583] [2019-12-07 19:22:02,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:02,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:22:02,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529282608] [2019-12-07 19:22:02,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:22:02,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:02,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:22:02,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:02,802 INFO L87 Difference]: Start difference. First operand 5944 states and 16718 transitions. Second operand 3 states. [2019-12-07 19:22:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:02,827 INFO L93 Difference]: Finished difference Result 5644 states and 15636 transitions. [2019-12-07 19:22:02,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:22:02,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-07 19:22:02,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:02,833 INFO L225 Difference]: With dead ends: 5644 [2019-12-07 19:22:02,833 INFO L226 Difference]: Without dead ends: 5644 [2019-12-07 19:22:02,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:02,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5644 states. [2019-12-07 19:22:02,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5644 to 5644. [2019-12-07 19:22:02,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5644 states. [2019-12-07 19:22:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5644 states to 5644 states and 15636 transitions. [2019-12-07 19:22:02,918 INFO L78 Accepts]: Start accepts. Automaton has 5644 states and 15636 transitions. Word has length 67 [2019-12-07 19:22:02,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:02,918 INFO L462 AbstractCegarLoop]: Abstraction has 5644 states and 15636 transitions. [2019-12-07 19:22:02,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:22:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 5644 states and 15636 transitions. [2019-12-07 19:22:02,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 19:22:02,925 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:02,925 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 19:22:02,925 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:02,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:02,925 INFO L82 PathProgramCache]: Analyzing trace with hash 15770806, now seen corresponding path program 1 times [2019-12-07 19:22:02,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:02,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167724117] [2019-12-07 19:22:02,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:22:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:22:03,039 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:22:03,039 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:22:03,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~y$mem_tmp~0_39 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$r_buff0_thd3~0_110) (= v_~main$tmp_guard0~0_18 0) (= v_~weak$$choice2~0_126 0) (= 0 v_~x~0_147) (= v_~y$r_buff0_thd0~0_348 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1~0_200 0) (= 0 v_~y$w_buff0~0_179) (= v_~y~0_170 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff1_thd0~0_299 0) (= 0 |v_ULTIMATE.start_main_~#t2186~0.offset_20|) (= 0 v_~y$r_buff1_thd2~0_193) (= v_~y$r_buff0_thd1~0_223 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t2186~0.base_27| 1)) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$flush_delayed~0_56) (= (select .cse0 |v_ULTIMATE.start_main_~#t2186~0.base_27|) 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2186~0.base_27| 4) |v_#length_25|) (= |v_#NULL.offset_5| 0) (= v_~y$w_buff1_used~0_482 0) (= 0 v_~y$r_buff1_thd3~0_211) (= 0 v_~y$r_buff0_thd2~0_114) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2186~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2186~0.base_27|) |v_ULTIMATE.start_main_~#t2186~0.offset_20| 0))) (= v_~__unbuffered_cnt~0_132 0) (= v_~y$w_buff0_used~0_741 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2186~0.base_27|) (= 0 v_~weak$$choice0~0_34) (= 0 |v_#NULL.base_5|) (= v_~y$r_buff1_thd1~0_185 0) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_61|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ULTIMATE.start_main_~#t2188~0.base=|v_ULTIMATE.start_main_~#t2188~0.base_19|, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_27|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_45|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_141|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_41|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_76|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_62|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_36|, ~y$mem_tmp~0=v_~y$mem_tmp~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_211, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_223, ~y$flush_delayed~0=v_~y$flush_delayed~0_56, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t2188~0.offset=|v_ULTIMATE.start_main_~#t2188~0.offset_16|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_82|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_54|, ULTIMATE.start_main_~#t2186~0.base=|v_ULTIMATE.start_main_~#t2186~0.base_27|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_64|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, ULTIMATE.start_main_~#t2187~0.base=|v_ULTIMATE.start_main_~#t2187~0.base_23|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_299, ~x~0=v_~x~0_147, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_61|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_741, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_73|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_161|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_30|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_76|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_185, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~y$w_buff0~0=v_~y$w_buff0~0_179, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ~y~0=v_~y~0_170, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_70|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_~#t2187~0.offset=|v_ULTIMATE.start_main_~#t2187~0.offset_18|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_25|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_50|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_193, ULTIMATE.start_main_~#t2186~0.offset=|v_ULTIMATE.start_main_~#t2186~0.offset_20|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_75|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_348, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_482} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2188~0.base, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2188~0.offset, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t2186~0.base, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2187~0.base, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2187~0.offset, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t2186~0.offset, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 19:22:03,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->L4-3: Formula: (and (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 0)) (= v_~y$w_buff0_used~0_135 1) (= 2 v_~y$w_buff0~0_28) (= v_~y$w_buff0~0_29 v_~y$w_buff1~0_20) (= v_P0Thread1of1ForFork0_~arg.offset_6 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_~y$w_buff1_used~0_63 v_~y$w_buff0_used~0_136) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_63 256) 0)) (not (= (mod v_~y$w_buff0_used~0_135 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_P0Thread1of1ForFork0_~arg.base_6 |v_P0Thread1of1ForFork0_#in~arg.base_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff0~0=v_~y$w_buff0~0_29, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_28, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_6, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_6, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 19:22:03,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L800-1-->L802: Formula: (and (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t2187~0.base_11| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2187~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2187~0.base_11|) |v_ULTIMATE.start_main_~#t2187~0.offset_10| 1)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t2187~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t2187~0.base_11|)) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t2187~0.base_11|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2187~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2187~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2187~0.offset=|v_ULTIMATE.start_main_~#t2187~0.offset_10|, ULTIMATE.start_main_~#t2187~0.base=|v_ULTIMATE.start_main_~#t2187~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2187~0.offset, ULTIMATE.start_main_~#t2187~0.base] because there is no mapped edge [2019-12-07 19:22:03,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L802-1-->L804: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2188~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2188~0.base_13|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2188~0.base_13|)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2188~0.base_13| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2188~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2188~0.base_13|) |v_ULTIMATE.start_main_~#t2188~0.offset_11| 2)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2188~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t2188~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, ULTIMATE.start_main_~#t2188~0.base=|v_ULTIMATE.start_main_~#t2188~0.base_13|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2188~0.offset=|v_ULTIMATE.start_main_~#t2188~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_~#t2188~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2188~0.offset] because there is no mapped edge [2019-12-07 19:22:03,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1805552586 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1805552586 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1805552586| ~y$w_buff0_used~0_In1805552586)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1805552586| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1805552586, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1805552586} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1805552586|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1805552586, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1805552586} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 19:22:03,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L757-2-->L757-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-160972602 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-160972602 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In-160972602 |P1Thread1of1ForFork1_#t~ite9_Out-160972602|)) (and (= ~y$w_buff1~0_In-160972602 |P1Thread1of1ForFork1_#t~ite9_Out-160972602|) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-160972602, ~y$w_buff1~0=~y$w_buff1~0_In-160972602, ~y~0=~y~0_In-160972602, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-160972602} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-160972602, ~y$w_buff1~0=~y$w_buff1~0_In-160972602, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-160972602|, ~y~0=~y~0_In-160972602, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-160972602} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 19:22:03,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L742-->L742-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In913916894 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In913916894 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In913916894 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In913916894 256) 0))) (or (and (= ~y$w_buff1_used~0_In913916894 |P0Thread1of1ForFork0_#t~ite6_Out913916894|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out913916894|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In913916894, ~y$w_buff0_used~0=~y$w_buff0_used~0_In913916894, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In913916894, ~y$w_buff1_used~0=~y$w_buff1_used~0_In913916894} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out913916894|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In913916894, ~y$w_buff0_used~0=~y$w_buff0_used~0_In913916894, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In913916894, ~y$w_buff1_used~0=~y$w_buff1_used~0_In913916894} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 19:22:03,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L743-->L744: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1521222724 256))) (.cse2 (= ~y$r_buff0_thd1~0_In-1521222724 ~y$r_buff0_thd1~0_Out-1521222724)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1521222724 256)))) (or (and (= 0 ~y$r_buff0_thd1~0_Out-1521222724) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1521222724, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1521222724} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1521222724, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1521222724|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1521222724} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:22:03,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1965485591 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1965485591 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1965485591 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1965485591 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1965485591| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out1965485591| ~y$r_buff1_thd1~0_In1965485591) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1965485591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1965485591, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1965485591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1965485591} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1965485591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1965485591, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1965485591|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1965485591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1965485591} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 19:22:03,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L744-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 19:22:03,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L777-2-->L777-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-816185846 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-816185846 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-816185846| ~y~0_In-816185846)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-816185846| ~y$w_buff1~0_In-816185846)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-816185846, ~y$w_buff1~0=~y$w_buff1~0_In-816185846, ~y~0=~y~0_In-816185846, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-816185846} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-816185846, P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-816185846|, ~y$w_buff1~0=~y$w_buff1~0_In-816185846, ~y~0=~y~0_In-816185846, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-816185846} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 19:22:03,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-4-->L778: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_6| v_~y~0_34) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_6|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_5|, ~y~0=v_~y~0_34, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~y~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-07 19:22:03,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L757-4-->L758: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_6| v_~y~0_38) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_6|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_5|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_5|, ~y~0=v_~y~0_38} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-07 19:22:03,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1543698328 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1543698328 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1543698328| ~y$w_buff0_used~0_In-1543698328)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1543698328| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1543698328, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1543698328} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1543698328, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1543698328, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1543698328|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 19:22:03,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L759-->L759-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1334352248 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1334352248 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1334352248 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1334352248 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1334352248|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1334352248 |P1Thread1of1ForFork1_#t~ite12_Out1334352248|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1334352248, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1334352248, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1334352248, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1334352248} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1334352248, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1334352248, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1334352248, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1334352248|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1334352248} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 19:22:03,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-109507910 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-109507910 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In-109507910 |P1Thread1of1ForFork1_#t~ite13_Out-109507910|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-109507910|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-109507910, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-109507910} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-109507910, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-109507910, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-109507910|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 19:22:03,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-2030967916 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-2030967916 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2030967916 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2030967916 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-2030967916|)) (and (= ~y$r_buff1_thd2~0_In-2030967916 |P1Thread1of1ForFork1_#t~ite14_Out-2030967916|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2030967916, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2030967916, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2030967916, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2030967916} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2030967916, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2030967916, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2030967916, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2030967916|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2030967916} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 19:22:03,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1893325563 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1893325563 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-1893325563| ~y$w_buff0_used~0_In-1893325563)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-1893325563|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1893325563, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1893325563} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1893325563, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1893325563, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1893325563|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 19:22:03,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-908218337 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-908218337 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-908218337 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-908218337 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out-908218337| ~y$w_buff1_used~0_In-908218337) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out-908218337| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-908218337, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-908218337, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-908218337, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-908218337} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-908218337, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-908218337, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-908218337, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-908218337|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-908218337} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-07 19:22:03,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L761-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_135 |v_P1Thread1of1ForFork1_#t~ite14_40|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_135, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_39|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 19:22:03,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-239374245 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-239374245 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-239374245 |P2Thread1of1ForFork2_#t~ite19_Out-239374245|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out-239374245|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-239374245, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-239374245} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-239374245, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-239374245, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-239374245|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-07 19:22:03,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1220960402 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1220960402 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1220960402 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1220960402 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite20_Out1220960402| ~y$r_buff1_thd3~0_In1220960402)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out1220960402| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1220960402, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1220960402, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1220960402, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1220960402} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1220960402, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1220960402, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1220960402|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1220960402, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1220960402} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-07 19:22:03,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L781-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_34| v_~y$r_buff1_thd3~0_132)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_132, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_33|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 19:22:03,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L804-1-->L810: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:22:03,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L810-2-->L810-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1301686517 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1301686517 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite25_Out-1301686517| |ULTIMATE.start_main_#t~ite24_Out-1301686517|))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out-1301686517| ~y~0_In-1301686517) (or .cse0 .cse1) .cse2) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite24_Out-1301686517| ~y$w_buff1~0_In-1301686517) (not .cse1) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1301686517, ~y~0=~y~0_In-1301686517, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1301686517, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1301686517} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1301686517, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1301686517|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1301686517|, ~y~0=~y~0_In-1301686517, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1301686517, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1301686517} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-07 19:22:03,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1310052735 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1310052735 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite26_Out1310052735|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite26_Out1310052735| ~y$w_buff0_used~0_In1310052735)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1310052735, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1310052735} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1310052735, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1310052735, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1310052735|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-07 19:22:03,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-239946226 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-239946226 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-239946226 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-239946226 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out-239946226| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-239946226 |ULTIMATE.start_main_#t~ite27_Out-239946226|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-239946226, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-239946226, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-239946226, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-239946226} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-239946226, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-239946226, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-239946226|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-239946226, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-239946226} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-07 19:22:03,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1971621390 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1971621390 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out1971621390| 0)) (and (= ~y$r_buff0_thd0~0_In1971621390 |ULTIMATE.start_main_#t~ite28_Out1971621390|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1971621390, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1971621390} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1971621390|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1971621390, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1971621390} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-07 19:22:03,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-553868662 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-553868662 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-553868662 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-553868662 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite29_Out-553868662| 0)) (and (= |ULTIMATE.start_main_#t~ite29_Out-553868662| ~y$r_buff1_thd0~0_In-553868662) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-553868662, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-553868662, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-553868662, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-553868662} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-553868662, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-553868662|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-553868662, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-553868662, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-553868662} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-07 19:22:03,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L823-->L823-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1371957515 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In1371957515| |ULTIMATE.start_main_#t~ite38_Out1371957515|) (= ~y$w_buff1~0_In1371957515 |ULTIMATE.start_main_#t~ite39_Out1371957515|)) (and .cse0 (= ~y$w_buff1~0_In1371957515 |ULTIMATE.start_main_#t~ite38_Out1371957515|) (= |ULTIMATE.start_main_#t~ite39_Out1371957515| |ULTIMATE.start_main_#t~ite38_Out1371957515|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1371957515 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1371957515 256) 0)) (= (mod ~y$w_buff0_used~0_In1371957515 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In1371957515 256) 0))))))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1371957515, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1371957515, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1371957515, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In1371957515|, ~weak$$choice2~0=~weak$$choice2~0_In1371957515, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1371957515, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1371957515} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1371957515, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1371957515, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1371957515|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1371957515, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1371957515|, ~weak$$choice2~0=~weak$$choice2~0_In1371957515, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1371957515, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1371957515} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 19:22:03,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L824-->L824-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In588482150 256) 0))) (or (and (= ~y$w_buff0_used~0_In588482150 |ULTIMATE.start_main_#t~ite41_Out588482150|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In588482150 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd0~0_In588482150 256)) .cse1) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In588482150 256))) (= 0 (mod ~y$w_buff0_used~0_In588482150 256)))) (= |ULTIMATE.start_main_#t~ite42_Out588482150| |ULTIMATE.start_main_#t~ite41_Out588482150|)) (and (= ~y$w_buff0_used~0_In588482150 |ULTIMATE.start_main_#t~ite42_Out588482150|) (not .cse0) (= |ULTIMATE.start_main_#t~ite41_In588482150| |ULTIMATE.start_main_#t~ite41_Out588482150|)))) InVars {ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In588482150|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In588482150, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In588482150, ~weak$$choice2~0=~weak$$choice2~0_In588482150, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In588482150, ~y$w_buff1_used~0=~y$w_buff1_used~0_In588482150} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out588482150|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In588482150, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In588482150, ~weak$$choice2~0=~weak$$choice2~0_In588482150, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out588482150|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In588482150, ~y$w_buff1_used~0=~y$w_buff1_used~0_In588482150} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 19:22:03,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L826-->L827: Formula: (and (= v_~y$r_buff0_thd0~0_133 v_~y$r_buff0_thd0~0_132) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_133, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_22|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 19:22:03,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L829-->L832-1: Formula: (and (not (= (mod v_~y$flush_delayed~0_45 256) 0)) (= 0 v_~y$flush_delayed~0_44) (= v_~y~0_135 v_~y$mem_tmp~0_33) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y~0=v_~y~0_135, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:22:03,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 19:22:03,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:22:03 BasicIcfg [2019-12-07 19:22:03,118 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:22:03,118 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:22:03,118 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:22:03,119 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:22:03,119 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:21:22" (3/4) ... [2019-12-07 19:22:03,121 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:22:03,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~y$mem_tmp~0_39 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$r_buff0_thd3~0_110) (= v_~main$tmp_guard0~0_18 0) (= v_~weak$$choice2~0_126 0) (= 0 v_~x~0_147) (= v_~y$r_buff0_thd0~0_348 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1~0_200 0) (= 0 v_~y$w_buff0~0_179) (= v_~y~0_170 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff1_thd0~0_299 0) (= 0 |v_ULTIMATE.start_main_~#t2186~0.offset_20|) (= 0 v_~y$r_buff1_thd2~0_193) (= v_~y$r_buff0_thd1~0_223 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t2186~0.base_27| 1)) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$flush_delayed~0_56) (= (select .cse0 |v_ULTIMATE.start_main_~#t2186~0.base_27|) 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2186~0.base_27| 4) |v_#length_25|) (= |v_#NULL.offset_5| 0) (= v_~y$w_buff1_used~0_482 0) (= 0 v_~y$r_buff1_thd3~0_211) (= 0 v_~y$r_buff0_thd2~0_114) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2186~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2186~0.base_27|) |v_ULTIMATE.start_main_~#t2186~0.offset_20| 0))) (= v_~__unbuffered_cnt~0_132 0) (= v_~y$w_buff0_used~0_741 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2186~0.base_27|) (= 0 v_~weak$$choice0~0_34) (= 0 |v_#NULL.base_5|) (= v_~y$r_buff1_thd1~0_185 0) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_61|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ULTIMATE.start_main_~#t2188~0.base=|v_ULTIMATE.start_main_~#t2188~0.base_19|, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_27|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_45|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_141|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_41|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_76|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_62|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_36|, ~y$mem_tmp~0=v_~y$mem_tmp~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_211, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_223, ~y$flush_delayed~0=v_~y$flush_delayed~0_56, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t2188~0.offset=|v_ULTIMATE.start_main_~#t2188~0.offset_16|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_82|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_54|, ULTIMATE.start_main_~#t2186~0.base=|v_ULTIMATE.start_main_~#t2186~0.base_27|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_64|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, ULTIMATE.start_main_~#t2187~0.base=|v_ULTIMATE.start_main_~#t2187~0.base_23|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_299, ~x~0=v_~x~0_147, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_61|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_741, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_73|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_161|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_30|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_76|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_185, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~y$w_buff0~0=v_~y$w_buff0~0_179, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ~y~0=v_~y~0_170, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_70|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_~#t2187~0.offset=|v_ULTIMATE.start_main_~#t2187~0.offset_18|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_25|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_50|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_193, ULTIMATE.start_main_~#t2186~0.offset=|v_ULTIMATE.start_main_~#t2186~0.offset_20|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_75|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_348, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_482} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2188~0.base, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2188~0.offset, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t2186~0.base, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2187~0.base, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2187~0.offset, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t2186~0.offset, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 19:22:03,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->L4-3: Formula: (and (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 0)) (= v_~y$w_buff0_used~0_135 1) (= 2 v_~y$w_buff0~0_28) (= v_~y$w_buff0~0_29 v_~y$w_buff1~0_20) (= v_P0Thread1of1ForFork0_~arg.offset_6 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_~y$w_buff1_used~0_63 v_~y$w_buff0_used~0_136) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_63 256) 0)) (not (= (mod v_~y$w_buff0_used~0_135 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_P0Thread1of1ForFork0_~arg.base_6 |v_P0Thread1of1ForFork0_#in~arg.base_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff0~0=v_~y$w_buff0~0_29, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_28, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_6, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_6, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 19:22:03,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L800-1-->L802: Formula: (and (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t2187~0.base_11| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2187~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2187~0.base_11|) |v_ULTIMATE.start_main_~#t2187~0.offset_10| 1)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t2187~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t2187~0.base_11|)) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t2187~0.base_11|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2187~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2187~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2187~0.offset=|v_ULTIMATE.start_main_~#t2187~0.offset_10|, ULTIMATE.start_main_~#t2187~0.base=|v_ULTIMATE.start_main_~#t2187~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2187~0.offset, ULTIMATE.start_main_~#t2187~0.base] because there is no mapped edge [2019-12-07 19:22:03,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L802-1-->L804: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2188~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2188~0.base_13|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2188~0.base_13|)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2188~0.base_13| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2188~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2188~0.base_13|) |v_ULTIMATE.start_main_~#t2188~0.offset_11| 2)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2188~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t2188~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, ULTIMATE.start_main_~#t2188~0.base=|v_ULTIMATE.start_main_~#t2188~0.base_13|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2188~0.offset=|v_ULTIMATE.start_main_~#t2188~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_~#t2188~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2188~0.offset] because there is no mapped edge [2019-12-07 19:22:03,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1805552586 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1805552586 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1805552586| ~y$w_buff0_used~0_In1805552586)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1805552586| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1805552586, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1805552586} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1805552586|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1805552586, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1805552586} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 19:22:03,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L757-2-->L757-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-160972602 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-160972602 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In-160972602 |P1Thread1of1ForFork1_#t~ite9_Out-160972602|)) (and (= ~y$w_buff1~0_In-160972602 |P1Thread1of1ForFork1_#t~ite9_Out-160972602|) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-160972602, ~y$w_buff1~0=~y$w_buff1~0_In-160972602, ~y~0=~y~0_In-160972602, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-160972602} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-160972602, ~y$w_buff1~0=~y$w_buff1~0_In-160972602, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-160972602|, ~y~0=~y~0_In-160972602, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-160972602} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 19:22:03,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L742-->L742-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In913916894 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In913916894 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In913916894 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In913916894 256) 0))) (or (and (= ~y$w_buff1_used~0_In913916894 |P0Thread1of1ForFork0_#t~ite6_Out913916894|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out913916894|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In913916894, ~y$w_buff0_used~0=~y$w_buff0_used~0_In913916894, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In913916894, ~y$w_buff1_used~0=~y$w_buff1_used~0_In913916894} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out913916894|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In913916894, ~y$w_buff0_used~0=~y$w_buff0_used~0_In913916894, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In913916894, ~y$w_buff1_used~0=~y$w_buff1_used~0_In913916894} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 19:22:03,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L743-->L744: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1521222724 256))) (.cse2 (= ~y$r_buff0_thd1~0_In-1521222724 ~y$r_buff0_thd1~0_Out-1521222724)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1521222724 256)))) (or (and (= 0 ~y$r_buff0_thd1~0_Out-1521222724) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1521222724, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1521222724} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1521222724, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1521222724|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1521222724} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:22:03,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1965485591 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1965485591 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1965485591 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1965485591 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1965485591| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out1965485591| ~y$r_buff1_thd1~0_In1965485591) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1965485591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1965485591, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1965485591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1965485591} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1965485591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1965485591, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1965485591|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1965485591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1965485591} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 19:22:03,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L744-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 19:22:03,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L777-2-->L777-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-816185846 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-816185846 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-816185846| ~y~0_In-816185846)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-816185846| ~y$w_buff1~0_In-816185846)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-816185846, ~y$w_buff1~0=~y$w_buff1~0_In-816185846, ~y~0=~y~0_In-816185846, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-816185846} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-816185846, P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-816185846|, ~y$w_buff1~0=~y$w_buff1~0_In-816185846, ~y~0=~y~0_In-816185846, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-816185846} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 19:22:03,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-4-->L778: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_6| v_~y~0_34) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_6|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_5|, ~y~0=v_~y~0_34, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~y~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-07 19:22:03,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L757-4-->L758: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_6| v_~y~0_38) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_6|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_5|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_5|, ~y~0=v_~y~0_38} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-07 19:22:03,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1543698328 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1543698328 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1543698328| ~y$w_buff0_used~0_In-1543698328)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1543698328| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1543698328, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1543698328} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1543698328, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1543698328, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1543698328|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 19:22:03,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L759-->L759-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1334352248 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1334352248 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1334352248 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1334352248 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1334352248|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1334352248 |P1Thread1of1ForFork1_#t~ite12_Out1334352248|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1334352248, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1334352248, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1334352248, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1334352248} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1334352248, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1334352248, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1334352248, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1334352248|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1334352248} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 19:22:03,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-109507910 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-109507910 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In-109507910 |P1Thread1of1ForFork1_#t~ite13_Out-109507910|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-109507910|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-109507910, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-109507910} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-109507910, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-109507910, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-109507910|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 19:22:03,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-2030967916 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-2030967916 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2030967916 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2030967916 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-2030967916|)) (and (= ~y$r_buff1_thd2~0_In-2030967916 |P1Thread1of1ForFork1_#t~ite14_Out-2030967916|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2030967916, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2030967916, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2030967916, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2030967916} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2030967916, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2030967916, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2030967916, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2030967916|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2030967916} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 19:22:03,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1893325563 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1893325563 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-1893325563| ~y$w_buff0_used~0_In-1893325563)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-1893325563|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1893325563, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1893325563} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1893325563, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1893325563, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1893325563|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 19:22:03,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-908218337 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-908218337 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-908218337 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-908218337 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out-908218337| ~y$w_buff1_used~0_In-908218337) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out-908218337| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-908218337, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-908218337, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-908218337, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-908218337} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-908218337, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-908218337, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-908218337, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-908218337|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-908218337} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-07 19:22:03,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L761-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_135 |v_P1Thread1of1ForFork1_#t~ite14_40|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_135, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_39|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 19:22:03,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-239374245 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-239374245 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-239374245 |P2Thread1of1ForFork2_#t~ite19_Out-239374245|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out-239374245|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-239374245, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-239374245} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-239374245, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-239374245, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-239374245|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-07 19:22:03,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1220960402 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1220960402 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1220960402 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1220960402 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite20_Out1220960402| ~y$r_buff1_thd3~0_In1220960402)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out1220960402| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1220960402, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1220960402, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1220960402, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1220960402} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1220960402, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1220960402, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1220960402|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1220960402, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1220960402} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-07 19:22:03,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L781-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_34| v_~y$r_buff1_thd3~0_132)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_132, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_33|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 19:22:03,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L804-1-->L810: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:22:03,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L810-2-->L810-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1301686517 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1301686517 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite25_Out-1301686517| |ULTIMATE.start_main_#t~ite24_Out-1301686517|))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out-1301686517| ~y~0_In-1301686517) (or .cse0 .cse1) .cse2) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite24_Out-1301686517| ~y$w_buff1~0_In-1301686517) (not .cse1) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1301686517, ~y~0=~y~0_In-1301686517, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1301686517, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1301686517} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1301686517, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1301686517|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1301686517|, ~y~0=~y~0_In-1301686517, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1301686517, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1301686517} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-07 19:22:03,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1310052735 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1310052735 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite26_Out1310052735|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite26_Out1310052735| ~y$w_buff0_used~0_In1310052735)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1310052735, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1310052735} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1310052735, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1310052735, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1310052735|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-07 19:22:03,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-239946226 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-239946226 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-239946226 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-239946226 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out-239946226| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-239946226 |ULTIMATE.start_main_#t~ite27_Out-239946226|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-239946226, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-239946226, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-239946226, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-239946226} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-239946226, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-239946226, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-239946226|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-239946226, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-239946226} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-07 19:22:03,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1971621390 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1971621390 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out1971621390| 0)) (and (= ~y$r_buff0_thd0~0_In1971621390 |ULTIMATE.start_main_#t~ite28_Out1971621390|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1971621390, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1971621390} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1971621390|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1971621390, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1971621390} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-07 19:22:03,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-553868662 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-553868662 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-553868662 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-553868662 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite29_Out-553868662| 0)) (and (= |ULTIMATE.start_main_#t~ite29_Out-553868662| ~y$r_buff1_thd0~0_In-553868662) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-553868662, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-553868662, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-553868662, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-553868662} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-553868662, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-553868662|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-553868662, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-553868662, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-553868662} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-07 19:22:03,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L823-->L823-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1371957515 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In1371957515| |ULTIMATE.start_main_#t~ite38_Out1371957515|) (= ~y$w_buff1~0_In1371957515 |ULTIMATE.start_main_#t~ite39_Out1371957515|)) (and .cse0 (= ~y$w_buff1~0_In1371957515 |ULTIMATE.start_main_#t~ite38_Out1371957515|) (= |ULTIMATE.start_main_#t~ite39_Out1371957515| |ULTIMATE.start_main_#t~ite38_Out1371957515|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1371957515 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1371957515 256) 0)) (= (mod ~y$w_buff0_used~0_In1371957515 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In1371957515 256) 0))))))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1371957515, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1371957515, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1371957515, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In1371957515|, ~weak$$choice2~0=~weak$$choice2~0_In1371957515, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1371957515, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1371957515} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1371957515, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1371957515, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1371957515|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1371957515, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1371957515|, ~weak$$choice2~0=~weak$$choice2~0_In1371957515, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1371957515, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1371957515} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 19:22:03,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L824-->L824-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In588482150 256) 0))) (or (and (= ~y$w_buff0_used~0_In588482150 |ULTIMATE.start_main_#t~ite41_Out588482150|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In588482150 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd0~0_In588482150 256)) .cse1) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In588482150 256))) (= 0 (mod ~y$w_buff0_used~0_In588482150 256)))) (= |ULTIMATE.start_main_#t~ite42_Out588482150| |ULTIMATE.start_main_#t~ite41_Out588482150|)) (and (= ~y$w_buff0_used~0_In588482150 |ULTIMATE.start_main_#t~ite42_Out588482150|) (not .cse0) (= |ULTIMATE.start_main_#t~ite41_In588482150| |ULTIMATE.start_main_#t~ite41_Out588482150|)))) InVars {ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In588482150|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In588482150, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In588482150, ~weak$$choice2~0=~weak$$choice2~0_In588482150, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In588482150, ~y$w_buff1_used~0=~y$w_buff1_used~0_In588482150} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out588482150|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In588482150, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In588482150, ~weak$$choice2~0=~weak$$choice2~0_In588482150, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out588482150|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In588482150, ~y$w_buff1_used~0=~y$w_buff1_used~0_In588482150} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 19:22:03,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L826-->L827: Formula: (and (= v_~y$r_buff0_thd0~0_133 v_~y$r_buff0_thd0~0_132) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_133, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_22|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 19:22:03,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L829-->L832-1: Formula: (and (not (= (mod v_~y$flush_delayed~0_45 256) 0)) (= 0 v_~y$flush_delayed~0_44) (= v_~y~0_135 v_~y$mem_tmp~0_33) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y~0=v_~y~0_135, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:22:03,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 19:22:03,210 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9354baaa-4f80-4ff5-817b-cf03493046f0/bin/utaipan/witness.graphml [2019-12-07 19:22:03,210 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:22:03,211 INFO L168 Benchmark]: Toolchain (without parser) took 41744.09 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.8 GB). Free memory was 935.4 MB in the beginning and 3.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 19:22:03,211 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:22:03,212 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.6 MB). Free memory was 935.4 MB in the beginning and 1.1 GB in the end (delta: -119.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:22:03,212 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:22:03,212 INFO L168 Benchmark]: Boogie Preprocessor took 33.11 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:22:03,213 INFO L168 Benchmark]: RCFGBuilder took 412.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 993.6 MB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-12-07 19:22:03,213 INFO L168 Benchmark]: TraceAbstraction took 40740.65 ms. Allocated memory was 1.1 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 993.6 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-12-07 19:22:03,214 INFO L168 Benchmark]: Witness Printer took 91.58 ms. Allocated memory is still 4.8 GB. Free memory was 3.4 GB in the beginning and 3.4 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-12-07 19:22:03,216 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 418.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.6 MB). Free memory was 935.4 MB in the beginning and 1.1 GB in the end (delta: -119.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.11 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 412.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 993.6 MB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 40740.65 ms. Allocated memory was 1.1 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 993.6 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 91.58 ms. Allocated memory is still 4.8 GB. Free memory was 3.4 GB in the beginning and 3.4 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 173 ProgramPointsBefore, 94 ProgramPointsAfterwards, 210 TransitionsBefore, 104 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 39 ConcurrentYvCompositions, 31 ChoiceCompositions, 5882 VarBasedMoverChecksPositive, 246 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 253 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 78185 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t2186, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] FCALL, FORK 0 pthread_create(&t2187, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L804] FCALL, FORK 0 pthread_create(&t2188, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L771] 3 __unbuffered_p2_EAX = x [L774] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L777] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 40.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2551 SDtfs, 2332 SDslu, 5456 SDs, 0 SdLazy, 2688 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 16 SyntacticMatches, 10 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156321occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 38260 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 613 NumberOfCodeBlocks, 613 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 531 ConstructedInterpolants, 0 QuantifiedInterpolants, 108243 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...